./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:26:04,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:26:04,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:26:04,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:26:04,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:26:04,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:26:04,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:26:04,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:26:04,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:26:04,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:26:04,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:26:04,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:26:04,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:26:04,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:26:04,787 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:26:04,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:26:04,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:26:04,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:26:04,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:26:04,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:26:04,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:26:04,790 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 [2025-02-07 17:26:05,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:26:05,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:26:05,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:26:05,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:26:05,073 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:26:05,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina5.c [2025-02-07 17:26:06,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e24bb89e/240bd9b47de045359586e39182c1ff5a/FLAGfa4efd29d [2025-02-07 17:26:06,442 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:26:06,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c [2025-02-07 17:26:06,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e24bb89e/240bd9b47de045359586e39182c1ff5a/FLAGfa4efd29d [2025-02-07 17:26:06,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e24bb89e/240bd9b47de045359586e39182c1ff5a [2025-02-07 17:26:06,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:26:06,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:26:06,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:26:06,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:26:06,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:26:06,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06, skipping insertion in model container [2025-02-07 17:26:06,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:26:06,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2025-02-07 17:26:06,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:26:06,596 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:26:06,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2025-02-07 17:26:06,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:26:06,619 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:26:06,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06 WrapperNode [2025-02-07 17:26:06,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:26:06,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:26:06,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:26:06,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:26:06,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,642 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2025-02-07 17:26:06,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:26:06,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:26:06,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:26:06,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:26:06,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,658 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 8, 5, 6, 2]. 35 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0]. The 6 writes are split as follows [0, 0, 2, 3, 1]. [2025-02-07 17:26:06,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:26:06,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:26:06,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:26:06,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:26:06,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (1/1) ... [2025-02-07 17:26:06,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:26:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:06,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:26:06,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:26:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 17:26:06,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:26:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 17:26:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:26:06,766 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:26:06,767 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:26:06,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-02-07 17:26:06,918 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-07 17:26:06,919 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:26:06,924 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:26:06,925 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:26:06,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:26:06 BoogieIcfgContainer [2025-02-07 17:26:06,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:26:06,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:26:06,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:26:06,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:26:06,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:26:06" (1/3) ... [2025-02-07 17:26:06,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:26:06, skipping insertion in model container [2025-02-07 17:26:06,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:26:06" (2/3) ... [2025-02-07 17:26:06,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:26:06, skipping insertion in model container [2025-02-07 17:26:06,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:26:06" (3/3) ... [2025-02-07 17:26:06,932 INFO L128 eAbstractionObserver]: Analyzing ICFG sina5.c [2025-02-07 17:26:06,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:26:06,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sina5.c that has 1 procedures, 17 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-07 17:26:06,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:26:06,995 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=LoopHeads, 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;@5a798cb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:26:06,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:26:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:26:07,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:07,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:07,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -835098695, now seen corresponding path program 1 times [2025-02-07 17:26:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629845329] [2025-02-07 17:26:07,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:07,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:26:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:26:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629845329] [2025-02-07 17:26:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629845329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:26:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:26:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:26:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311354543] [2025-02-07 17:26:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:26:07,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:26:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:07,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:26:07,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:26:07,169 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:07,181 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2025-02-07 17:26:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:26:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2025-02-07 17:26:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:07,187 INFO L225 Difference]: With dead ends: 31 [2025-02-07 17:26:07,188 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 17:26:07,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:26:07,195 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:07,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:26:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 17:26:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 17:26:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-02-07 17:26:07,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 12 [2025-02-07 17:26:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:07,220 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-02-07 17:26:07,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-02-07 17:26:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:26:07,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:07,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:07,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:26:07,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:07,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1031612200, now seen corresponding path program 1 times [2025-02-07 17:26:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830705286] [2025-02-07 17:26:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:26:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:26:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830705286] [2025-02-07 17:26:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830705286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:26:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:26:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:26:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054872544] [2025-02-07 17:26:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:26:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:26:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:07,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:26:07,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:26:07,407 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:07,467 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-02-07 17:26:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:26:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-02-07 17:26:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:07,468 INFO L225 Difference]: With dead ends: 33 [2025-02-07 17:26:07,468 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 17:26:07,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:26:07,470 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:07,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 17:26:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2025-02-07 17:26:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-07 17:26:07,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-02-07 17:26:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:07,479 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-07 17:26:07,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-02-07 17:26:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 17:26:07,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:07,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:07,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:26:07,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:07,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1221808047, now seen corresponding path program 1 times [2025-02-07 17:26:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425382287] [2025-02-07 17:26:07,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 17:26:07,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 17:26:07,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:07,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425382287] [2025-02-07 17:26:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425382287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386514839] [2025-02-07 17:26:08,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:08,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:08,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:26:08,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 17:26:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 17:26:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:08,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-07 17:26:08,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:08,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:08,872 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:08,943 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:08,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:09,026 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:09,067 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:09,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:09,241 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 31 treesize of output 29 [2025-02-07 17:26:09,244 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 49 treesize of output 47 [2025-02-07 17:26:09,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-02-07 17:26:09,339 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 36 treesize of output 34 [2025-02-07 17:26:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386514839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:09,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-02-07 17:26:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451645263] [2025-02-07 17:26:09,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 17:26:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:09,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 17:26:09,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:26:09,376 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:09,958 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2025-02-07 17:26:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 17:26:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 17:26:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:09,959 INFO L225 Difference]: With dead ends: 45 [2025-02-07 17:26:09,959 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 17:26:09,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 17:26:09,960 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:09,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 103 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:26:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 17:26:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2025-02-07 17:26:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-02-07 17:26:09,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 17 [2025-02-07 17:26:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:09,977 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-02-07 17:26:09,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2025-02-07 17:26:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 17:26:09,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:09,977 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:09,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 17:26:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:10,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 138431896, now seen corresponding path program 2 times [2025-02-07 17:26:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-02-07 17:26:10,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:10,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-07 17:26:10,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:26:10,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:10,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-02-07 17:26:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777153107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915500156] [2025-02-07 17:26:10,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:10,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:10,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:26:10,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-07 17:26:10,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:26:10,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:10,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:26:10,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:10,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915500156] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:10,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:26:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39748862] [2025-02-07 17:26:10,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:26:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:10,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:26:10,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:26:10,456 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:10,568 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2025-02-07 17:26:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:26:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 18 [2025-02-07 17:26:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:10,570 INFO L225 Difference]: With dead ends: 76 [2025-02-07 17:26:10,570 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 17:26:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:26:10,571 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:10,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 17:26:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2025-02-07 17:26:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-02-07 17:26:10,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2025-02-07 17:26:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:10,581 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-07 17:26:10,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2025-02-07 17:26:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 17:26:10,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:10,583 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:10,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 17:26:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:10,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2083997384, now seen corresponding path program 3 times [2025-02-07 17:26:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286052030] [2025-02-07 17:26:10,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:26:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:10,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-07 17:26:10,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:26:10,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:26:10,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286052030] [2025-02-07 17:26:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286052030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062854518] [2025-02-07 17:26:10,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:26:10,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:10,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:10,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:26:10,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-07 17:26:10,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:26:10,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:26:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:10,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:26:10,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:10,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:26:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062854518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:11,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:11,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:26:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871366984] [2025-02-07 17:26:11,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:11,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:26:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:11,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:26:11,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:26:11,022 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:11,123 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-02-07 17:26:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:26:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 18 [2025-02-07 17:26:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:11,123 INFO L225 Difference]: With dead ends: 44 [2025-02-07 17:26:11,123 INFO L226 Difference]: Without dead ends: 34 [2025-02-07 17:26:11,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:26:11,124 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:11,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 35 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-07 17:26:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2025-02-07 17:26:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-07 17:26:11,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2025-02-07 17:26:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:11,132 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-07 17:26:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-02-07 17:26:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 17:26:11,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:11,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:11,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:26:11,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:11,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:11,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2109360328, now seen corresponding path program 4 times [2025-02-07 17:26:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480141317] [2025-02-07 17:26:11,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:26:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:11,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-02-07 17:26:11,420 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:26:11,421 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:26:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480141317] [2025-02-07 17:26:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480141317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873400932] [2025-02-07 17:26:12,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:26:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:12,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:12,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:26:12,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-02-07 17:26:12,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:26:12,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:26:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:12,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-07 17:26:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:12,744 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:12,796 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:12,833 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 19 treesize of output 18 [2025-02-07 17:26:13,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:13,117 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 19 treesize of output 18 [2025-02-07 17:26:13,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:13,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:13,797 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:13,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:13,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:13,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-02-07 17:26:14,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:26:14,068 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 17:26:14,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2025-02-07 17:26:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:14,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:14,605 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 68 treesize of output 64 [2025-02-07 17:26:14,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:14,612 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 585 treesize of output 561 [2025-02-07 17:26:14,829 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 56 treesize of output 52 [2025-02-07 17:26:14,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:14,834 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 371 treesize of output 347 [2025-02-07 17:26:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873400932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:14,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2025-02-07 17:26:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330069836] [2025-02-07 17:26:14,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-07 17:26:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:14,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-07 17:26:14,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2128, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 17:26:14,880 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:16,259 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2025-02-07 17:26:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-07 17:26:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 22 [2025-02-07 17:26:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:16,263 INFO L225 Difference]: With dead ends: 77 [2025-02-07 17:26:16,263 INFO L226 Difference]: Without dead ends: 65 [2025-02-07 17:26:16,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=423, Invalid=4407, Unknown=0, NotChecked=0, Total=4830 [2025-02-07 17:26:16,267 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:16,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 158 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 17:26:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-07 17:26:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2025-02-07 17:26:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-02-07 17:26:16,281 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2025-02-07 17:26:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:16,281 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-02-07 17:26:16,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-02-07 17:26:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 17:26:16,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:16,283 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:16,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:26:16,487 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,SelfDestructingSolverStorable5 [2025-02-07 17:26:16,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:16,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1665608559, now seen corresponding path program 5 times [2025-02-07 17:26:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443055495] [2025-02-07 17:26:16,488 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:26:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:16,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-02-07 17:26:16,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:26:16,526 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:26:16,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:26:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443055495] [2025-02-07 17:26:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443055495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917624157] [2025-02-07 17:26:16,689 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:26:16,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:16,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:16,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:26:16,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-02-07 17:26:16,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:26:16,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:26:16,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:16,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:26:16,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:26:16,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:26:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917624157] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:16,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-07 17:26:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648856633] [2025-02-07 17:26:16,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:16,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:26:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:16,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:26:16,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:26:16,856 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:17,019 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2025-02-07 17:26:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:26:17,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 17:26:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:17,020 INFO L225 Difference]: With dead ends: 95 [2025-02-07 17:26:17,020 INFO L226 Difference]: Without dead ends: 68 [2025-02-07 17:26:17,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-02-07 17:26:17,021 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:17,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 62 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-07 17:26:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2025-02-07 17:26:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-07 17:26:17,029 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 23 [2025-02-07 17:26:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:17,030 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-07 17:26:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-07 17:26:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 17:26:17,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:17,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:17,037 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-02-07 17:26:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:17,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 95213048, now seen corresponding path program 6 times [2025-02-07 17:26:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825642692] [2025-02-07 17:26:17,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:26:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:17,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 3 equivalence classes. [2025-02-07 17:26:17,254 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:26:17,255 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:26:17,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:26:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825642692] [2025-02-07 17:26:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825642692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162558505] [2025-02-07 17:26:17,328 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:26:17,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:17,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:17,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:17,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:26:17,376 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 3 equivalence classes. [2025-02-07 17:26:17,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:26:17,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:26:17,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:17,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:26:17,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:26:17,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:26:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162558505] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:17,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-07 17:26:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969904499] [2025-02-07 17:26:17,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:26:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:17,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:26:17,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:26:17,495 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:17,637 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-02-07 17:26:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:26:17,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 24 [2025-02-07 17:26:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:17,638 INFO L225 Difference]: With dead ends: 78 [2025-02-07 17:26:17,638 INFO L226 Difference]: Without dead ends: 63 [2025-02-07 17:26:17,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:26:17,639 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:17,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-07 17:26:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2025-02-07 17:26:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-02-07 17:26:17,646 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2025-02-07 17:26:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-02-07 17:26:17,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-02-07 17:26:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 17:26:17,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:17,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:17,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 17:26:17,851 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,SelfDestructingSolverStorable7 [2025-02-07 17:26:17,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:17,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash -286150861, now seen corresponding path program 1 times [2025-02-07 17:26:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473436434] [2025-02-07 17:26:17,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:17,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:26:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:26:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:19,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473436434] [2025-02-07 17:26:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473436434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897210578] [2025-02-07 17:26:19,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:26:19,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:19,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:19,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:26:19,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:26:19,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:26:19,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:19,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:19,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-07 17:26:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:19,398 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:19,406 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:19,419 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 19 treesize of output 18 [2025-02-07 17:26:19,450 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:19,495 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 19 treesize of output 18 [2025-02-07 17:26:19,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:19,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:19,669 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:19,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:19,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:19,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-02-07 17:26:19,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:19,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:20,279 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 68 treesize of output 64 [2025-02-07 17:26:20,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:20,283 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 581 treesize of output 557 [2025-02-07 17:26:20,424 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 56 treesize of output 52 [2025-02-07 17:26:20,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:20,428 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 371 treesize of output 347 [2025-02-07 17:26:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897210578] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:20,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 46 [2025-02-07 17:26:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706518810] [2025-02-07 17:26:20,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-07 17:26:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:20,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-07 17:26:20,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1895, Unknown=0, NotChecked=0, Total=2070 [2025-02-07 17:26:20,473 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:21,011 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-02-07 17:26:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 17:26:21,011 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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 25 [2025-02-07 17:26:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:21,012 INFO L225 Difference]: With dead ends: 48 [2025-02-07 17:26:21,012 INFO L226 Difference]: Without dead ends: 29 [2025-02-07 17:26:21,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 17:26:21,013 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:26:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-07 17:26:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-07 17:26:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-07 17:26:21,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 25 [2025-02-07 17:26:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:21,017 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-07 17:26:21,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-07 17:26:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 17:26:21,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:21,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:21,023 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-02-07 17:26:21,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:21,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:21,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash -259744433, now seen corresponding path program 7 times [2025-02-07 17:26:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-02-07 17:26:21,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:26:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:21,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 17:26:21,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:26:21,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:21,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-02-07 17:26:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261248620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888286468] [2025-02-07 17:26:23,209 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:26:23,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:23,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:23,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:26:23,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 17:26:23,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:26:23,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:26:23,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:23,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-07 17:26:23,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:23,285 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:23,297 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:23,309 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 19 treesize of output 18 [2025-02-07 17:26:23,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:23,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:26:23,391 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:23,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:26:23,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:23,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:26:23,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:23,597 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:23,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:23,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:23,860 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:23,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:24,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:24,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:26:24,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:24,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2025-02-07 17:26:24,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:26:24,105 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 17:26:24,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2025-02-07 17:26:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:24,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:25,254 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 140 treesize of output 134 [2025-02-07 17:26:25,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:25,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33277 treesize of output 32637 [2025-02-07 17:26:33,385 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 733 treesize of output 693 [2025-02-07 17:26:33,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82610 treesize of output 79410 [2025-02-07 17:26:33,570 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 88 treesize of output 82 [2025-02-07 17:26:33,576 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 89 treesize of output 83 [2025-02-07 17:26:33,581 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 59 treesize of output 55 [2025-02-07 17:26:33,586 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 118 treesize of output 110 [2025-02-07 17:26:33,590 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 147 treesize of output 137 [2025-02-07 17:26:33,597 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 177 treesize of output 165 [2025-02-07 17:26:33,601 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 27 treesize of output 25 [2025-02-07 17:26:33,605 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 118 treesize of output 110 [2025-02-07 17:26:33,611 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 89 treesize of output 83 [2025-02-07 17:26:33,616 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 147 treesize of output 137 [2025-02-07 17:26:33,620 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 88 treesize of output 82 [2025-02-07 17:26:33,624 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 117 treesize of output 109 [2025-02-07 17:26:33,629 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 118 treesize of output 110 [2025-02-07 17:26:33,634 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 148 treesize of output 138 [2025-02-07 17:26:33,640 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 118 treesize of output 110 [2025-02-07 17:26:33,645 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 119 treesize of output 111 [2025-02-07 17:26:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:33,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888286468] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:33,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 58 [2025-02-07 17:26:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233058167] [2025-02-07 17:26:33,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:33,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-07 17:26:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:33,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-07 17:26:33,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3074, Unknown=0, NotChecked=0, Total=3306 [2025-02-07 17:26:33,791 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 58 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:41,632 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-02-07 17:26:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-07 17:26:41,632 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 27 [2025-02-07 17:26:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:41,632 INFO L225 Difference]: With dead ends: 66 [2025-02-07 17:26:41,632 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 17:26:41,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=324, Invalid=3966, Unknown=0, NotChecked=0, Total=4290 [2025-02-07 17:26:41,634 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 16 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:41,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 193 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 905 Invalid, 16 Unknown, 0 Unchecked, 5.4s Time] [2025-02-07 17:26:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 17:26:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2025-02-07 17:26:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-07 17:26:41,647 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 27 [2025-02-07 17:26:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:41,648 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-07 17:26:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-07 17:26:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:26:41,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:41,650 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:41,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 17:26:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:41,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 474168312, now seen corresponding path program 8 times [2025-02-07 17:26:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563971182] [2025-02-07 17:26:41,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:41,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-07 17:26:41,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:26:41,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563971182] [2025-02-07 17:26:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563971182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250782619] [2025-02-07 17:26:41,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:41,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:41,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:41,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:26:42,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-07 17:26:42,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:26:42,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:42,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 17:26:42,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:42,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:42,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250782619] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:42,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:42,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-02-07 17:26:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645358037] [2025-02-07 17:26:42,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 17:26:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:42,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 17:26:42,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:26:42,143 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:42,306 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2025-02-07 17:26:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:26:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 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 28 [2025-02-07 17:26:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:42,307 INFO L225 Difference]: With dead ends: 129 [2025-02-07 17:26:42,307 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 17:26:42,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-02-07 17:26:42,307 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 96 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:42,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 59 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:26:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 17:26:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2025-02-07 17:26:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-02-07 17:26:42,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2025-02-07 17:26:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-02-07 17:26:42,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-02-07 17:26:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:26:42,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:42,332 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:42,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 17:26:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:42,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash 955150232, now seen corresponding path program 9 times [2025-02-07 17:26:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-07 17:26:42,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:26:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:42,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-02-07 17:26:42,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:26:42,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:26:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-07 17:26:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754060692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553514890] [2025-02-07 17:26:42,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:26:42,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:42,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:42,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 17:26:42,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-02-07 17:26:42,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:26:42,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:26:42,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:42,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 17:26:42,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:42,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:26:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553514890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:42,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-02-07 17:26:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189890721] [2025-02-07 17:26:42,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:42,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 17:26:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:42,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 17:26:42,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:26:42,998 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:26:43,219 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-02-07 17:26:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 17:26:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 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 28 [2025-02-07 17:26:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:26:43,219 INFO L225 Difference]: With dead ends: 104 [2025-02-07 17:26:43,219 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 17:26:43,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-02-07 17:26:43,220 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:26:43,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:26:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 17:26:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2025-02-07 17:26:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-02-07 17:26:43,236 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 28 [2025-02-07 17:26:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:26:43,236 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-02-07 17:26:43,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:26:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-02-07 17:26:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 17:26:43,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:26:43,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:26:43,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 17:26:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 17:26:43,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:26:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:26:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1485536700, now seen corresponding path program 2 times [2025-02-07 17:26:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:26:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464362317] [2025-02-07 17:26:43,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:26:43,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-07 17:26:43,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 17:26:43,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:43,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:26:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464362317] [2025-02-07 17:26:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464362317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:26:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144281594] [2025-02-07 17:26:45,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:26:45,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:26:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:26:45,024 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:26:45,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:26:45,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-07 17:26:45,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 17:26:45,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:26:45,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:26:45,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-07 17:26:45,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:26:45,120 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:45,127 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:45,142 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 19 treesize of output 18 [2025-02-07 17:26:45,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:45,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:26:45,290 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:26:45,348 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 19 treesize of output 18 [2025-02-07 17:26:45,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:26:45,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:45,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:45,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:45,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:45,856 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:45,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:26:46,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:46,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2025-02-07 17:26:46,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-02-07 17:26:46,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:26:46,118 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 17:26:46,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2025-02-07 17:26:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:26:46,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:26:47,667 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 142 treesize of output 136 [2025-02-07 17:26:47,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:47,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35445 treesize of output 34805 [2025-02-07 17:26:53,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (* (select .cse0 .cse1) 2)) (.cse24 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse29 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse30 (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse4 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse62 (not .cse30)) (.cse11 (not .cse29)) (.cse23 (not .cse24)) (.cse2 (+ .cse7 .cse8 .cse9 3 .cse10)) (.cse3 (+ (* c_~N~0 2) 1)) (.cse33 (not .cse16))) (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_747 Int)) (or (= (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 .cse2) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (not .cse4)) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse5 .cse1 .cse2) .cse6 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse5 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse6 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse5 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse6 v_ArrVal_750) .cse1))))) .cse11) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse12 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse12 .cse1 .cse2) .cse13 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_105 Int)) (or (forall ((v_arrayElimCell_104 Int)) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse12 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse13 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse12 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse13 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse12 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse13 v_ArrVal_750) .cse1)))) (= (select (store (store .cse12 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse13 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse12 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse13 v_ArrVal_750) .cse1) .cse3)))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse14 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse15 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse14 .cse1 .cse2) .cse15 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse14 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse15 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse14 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse15 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse14 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse15 v_ArrVal_750) .cse1)) (= (select (store (store .cse14 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse15 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse17 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse18 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse17 .cse1 .cse2) .cse18 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_105 Int)) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse17 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse18 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse17 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse18 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse17 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse18 v_ArrVal_750) .cse1)))) (= (select (store (store .cse17 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse18 v_ArrVal_750) .cse1) .cse3)))))))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse19 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse20 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse19 .cse1 .cse2) .cse20 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse19 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse20 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse19 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse20 v_ArrVal_750) .cse1)) (= (select (store (store .cse19 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse20 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse21 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse22 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse21 .cse1 .cse2) .cse22 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse21 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse22 v_ArrVal_750) .cse1)) (= (select (store (store .cse21 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse22 v_ArrVal_750) .cse1) .cse3)))) .cse23) (or .cse24 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse25 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse26 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse25 .cse1 .cse2) .cse26 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store .cse25 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse26 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse25 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse26 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse25 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse26 v_ArrVal_750) .cse1))))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse27 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse28 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse27 .cse1 .cse2) .cse28 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse27 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse28 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse27 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse28 v_ArrVal_750) .cse1))))) .cse16)))) .cse29) (or .cse30 (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int)) (let ((.cse31 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse32 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse31 .cse1 .cse2) .cse32 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse31 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse32 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) .cse33) (or .cse29 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse34 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse35 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse34 .cse1 .cse2) .cse35 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse34 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse35 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store .cse34 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse35 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse34 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse35 v_ArrVal_750) .cse1) .cse3)))))))))) (or .cse24 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse36 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse37 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse36 .cse1 .cse2) .cse37 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse36 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse37 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse36 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse37 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))))) (or (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse38 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse39 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse38 .cse1 .cse2) .cse39 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse38 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse39 v_ArrVal_750) .cse1) .cse3)))) .cse23) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse40 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse41 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse40 .cse1 .cse2) .cse41 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store .cse40 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse41 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse40 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse41 v_ArrVal_750) .cse1) .cse3)))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or .cse24 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse42 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse43 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse42 .cse1 .cse2) .cse43 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse42 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse43 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))))) .cse16) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse44 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse45 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse44 .cse1 .cse2) .cse45 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse44 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse45 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse44 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse45 v_ArrVal_750) .cse1) .cse3)))) .cse23))) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse46 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse47 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse46 .cse1 .cse2) .cse47 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_105 Int)) (or (forall ((v_arrayElimCell_104 Int)) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse46 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse47 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse46 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse47 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse46 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse47 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse46 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse47 v_ArrVal_750) .cse1) .cse3)))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse48 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse49 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse48 .cse1 .cse2) .cse49 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_105 Int)) (or (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int)) (or (= (select (store (store .cse48 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse49 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse48 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse49 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse48 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse49 v_ArrVal_750) .cse1) .cse3)))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse50 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse51 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse50 .cse1 .cse2) .cse51 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse50 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse51 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse50 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse51 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) .cse16)) .cse24) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse52 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse53 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse52 .cse1 .cse2) .cse53 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse52 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse53 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) .cse11) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse54 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse55 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse54 .cse1 .cse2) .cse55 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse54 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse55 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse54 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse55 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse54 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse55 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse56 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse57 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse56 .cse1 .cse2) .cse57 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse56 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse57 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse56 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse57 v_ArrVal_750) .cse1) .cse3)))) .cse23))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse58 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse59 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse58 .cse1 .cse2) .cse59 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse58 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse59 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse58 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse59 v_ArrVal_750) .cse1)) (= (select (store (store .cse58 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse59 v_ArrVal_750) .cse1) .cse3)))) .cse23) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int)) (let ((.cse60 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse61 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse60 .cse1 .cse2) .cse61 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse60 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse61 v_ArrVal_750) .cse1))))) .cse62) (or .cse4 (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse63 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse64 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse63 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse64 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse63 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse64 v_ArrVal_750) .cse1)) (= (select (store (store .cse63 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse64 v_ArrVal_750) .cse1) .cse3)))) .cse23) (or .cse11 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse65 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse66 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse65 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse66 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse65 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse66 v_ArrVal_750) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse67 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse68 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (forall ((v_arrayElimCell_104 Int)) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse67 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse68 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse67 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse68 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse67 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse68 v_ArrVal_750) .cse1)))) (= (select (store (store .cse67 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse68 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse67 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse68 v_ArrVal_750) .cse1) .cse3)))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1)))) .cse62) (or (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse69 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse70 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse69 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse70 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse69 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse70 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse69 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse70 v_ArrVal_750) .cse1)))) (= (select (store (store .cse69 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse70 v_ArrVal_750) .cse1) .cse3)))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse71 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse72 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse71 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse72 v_ArrVal_750) .cse1)) (= (select (store (store .cse71 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse72 v_ArrVal_750) .cse1) .cse3)))) .cse23) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse73 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse74 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse73 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse74 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse73 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse74 v_ArrVal_750) .cse1)) (= (select (store (store .cse73 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse74 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or .cse24 (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse75 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse76 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse75 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse76 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse75 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse76 v_ArrVal_750) .cse1))))) .cse16) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse77 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse78 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse77 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse78 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse77 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse78 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse77 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse78 v_ArrVal_750) .cse1))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))))) .cse29) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse79 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse80 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse79 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse80 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse79 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse80 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse79 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse80 v_ArrVal_750) .cse1)) (= (select (store (store .cse79 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse80 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or .cse30 (and (or (and (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse81 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse82 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse81 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse82 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse81 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse82 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) .cse16) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse83 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse84 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int)) (or (= (select (store (store .cse83 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse84 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse83 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse84 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse83 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse84 v_ArrVal_750) .cse1) .cse3))))))) .cse24) (or .cse11 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse85 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse86 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse85 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse86 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse85 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse86 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse85 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse86 v_ArrVal_750) .cse1) .cse3)))) .cse16) (or (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int)) (let ((.cse87 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse88 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse87 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse88 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store .cse87 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse88 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse87 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse88 v_ArrVal_750) .cse1) .cse3)))))))) (or (and (or .cse24 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse89 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse90 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse89 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse90 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse89 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse90 v_ArrVal_750) .cse1) .cse3)))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1) .cse3))) .cse23)) .cse16) (or .cse24 (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse91 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse92 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse91 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse92 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse91 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse92 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse93 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse94 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse93 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse94 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse93 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse94 v_ArrVal_750) .cse1) .cse3)))) .cse23)) .cse29) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse95 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse96 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (forall ((v_arrayElimCell_104 Int)) (or (forall ((v_arrayElimCell_103 Int)) (or (= (select (store (store .cse95 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse96 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse95 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse96 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse95 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse96 v_ArrVal_750) .cse1) .cse3))) (= (select (store (store .cse95 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse96 v_ArrVal_750) .cse1) .cse3)))))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse97 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse98 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse97 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse98 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= (select (store (store .cse97 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 .cse10 1)) .cse98 v_ArrVal_750) .cse1) .cse3)))) .cse23) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int)) (or (= (select (store (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747) .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) .cse33))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int)) (let ((.cse99 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse100 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse99 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse100 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse99 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse100 v_ArrVal_750) .cse1))))) .cse33) (or .cse24 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse101 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse102 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse101 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse102 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int)) (or (= (select (store (store .cse101 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse102 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse101 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse102 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse101 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse102 v_ArrVal_750) .cse1))))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_747 Int) (v_arrayElimCell_105 Int)) (let ((.cse103 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse104 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse103 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse104 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse103 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse104 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse103 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse104 v_ArrVal_750) .cse1))))) .cse16))))) (or .cse24 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((v_ArrVal_750 Int) (v_ArrVal_747 Int)) (let ((.cse105 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse106 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse105 .cse1 .cse2) .cse106 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_105 Int)) (or (= (select (store (store .cse105 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse106 v_ArrVal_750) .cse1) .cse3) (forall ((v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int)) (or (= (select (store (store .cse105 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse106 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse105 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse106 v_ArrVal_750) .cse1) .cse3) (= .cse3 (select (store (store .cse105 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse106 v_ArrVal_750) .cse1))))))))) (< |v_ULTIMATE.start_main_~i~0#1_260| 2))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse107 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse108 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse107 .cse1 .cse2) .cse108 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse107 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_105 v_arrayElimCell_104 v_arrayElimCell_103 .cse10)) .cse108 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse107 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_105 .cse10)) .cse108 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse107 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse108 v_ArrVal_750) .cse1))))) .cse16))) (or (forall ((v_ArrVal_750 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_arrayElimCell_104 Int) (v_ArrVal_747 Int) (v_arrayElimCell_103 Int)) (let ((.cse109 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_747)) (.cse110 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_260|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (select (store (store .cse109 .cse1 .cse2) .cse110 v_ArrVal_750) .cse1) .cse3) (= (select (store (store .cse109 .cse1 (+ .cse7 .cse8 .cse9 2 v_arrayElimCell_103 .cse10)) .cse110 v_ArrVal_750) .cse1) .cse3) (< |v_ULTIMATE.start_main_~i~0#1_260| 2) (= .cse3 (select (store (store .cse109 .cse1 (+ .cse7 .cse8 .cse9 v_arrayElimCell_104 v_arrayElimCell_103 .cse10 1)) .cse110 v_ArrVal_750) .cse1))))) .cse33))))) is different from false [2025-02-07 17:26:58,139 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 595 treesize of output 563 [2025-02-07 17:26:58,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:26:58,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64701 treesize of output 62141 [2025-02-07 17:26:58,281 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 125 treesize of output 117 [2025-02-07 17:26:58,286 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 94 treesize of output 88 [2025-02-07 17:26:58,291 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 157 treesize of output 147 [2025-02-07 17:26:58,295 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 126 treesize of output 118 [2025-02-07 17:26:58,301 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 158 treesize of output 148 [2025-02-07 17:26:58,305 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 29 treesize of output 27 [2025-02-07 17:26:58,310 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 95 treesize of output 89 [2025-02-07 17:26:58,314 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 95 treesize of output 89 [2025-02-07 17:26:58,319 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 94 treesize of output 88 [2025-02-07 17:26:58,324 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 63 treesize of output 59 [2025-02-07 17:26:58,329 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 126 treesize of output 118 [2025-02-07 17:26:58,334 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 158 treesize of output 148 [2025-02-07 17:26:58,340 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 126 treesize of output 118 [2025-02-07 17:26:58,346 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 189 treesize of output 177 [2025-02-07 17:26:58,351 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 126 treesize of output 118 [2025-02-07 17:26:58,357 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 157 treesize of output 147 [2025-02-07 17:26:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-07 17:26:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144281594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:26:58,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:26:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 69 [2025-02-07 17:26:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292112765] [2025-02-07 17:26:58,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:26:58,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-02-07 17:26:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:26:58,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-02-07 17:26:58,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=4185, Unknown=1, NotChecked=132, Total=4692 [2025-02-07 17:26:58,442 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:02,282 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-02-07 17:27:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-07 17:27:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 17:27:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:02,284 INFO L225 Difference]: With dead ends: 62 [2025-02-07 17:27:02,285 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 17:27:02,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=524, Invalid=5959, Unknown=1, NotChecked=158, Total=6642 [2025-02-07 17:27:02,286 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:02,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 252 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1231 Invalid, 0 Unknown, 51 Unchecked, 1.5s Time] [2025-02-07 17:27:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 17:27:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-02-07 17:27:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-02-07 17:27:02,305 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 30 [2025-02-07 17:27:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:02,305 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-02-07 17:27:02,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-02-07 17:27:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 17:27:02,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:02,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:02,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:27:02,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-07 17:27:02,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -368173672, now seen corresponding path program 10 times [2025-02-07 17:27:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102878619] [2025-02-07 17:27:02,511 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:27:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:02,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-07 17:27:02,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 17:27:02,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:27:02,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102878619] [2025-02-07 17:27:04,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102878619] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661181] [2025-02-07 17:27:04,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:27:04,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:04,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:04,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:04,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:27:04,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-07 17:27:04,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 17:27:04,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:27:04,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:04,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-07 17:27:04,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:04,630 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:04,656 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:04,686 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 19 treesize of output 18 [2025-02-07 17:27:04,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:04,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:27:04,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:04,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 17:27:04,862 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:04,915 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 19 treesize of output 18 [2025-02-07 17:27:04,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:27:05,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:05,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 17:27:05,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,496 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:05,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:05,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:27:05,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:05,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 34 [2025-02-07 17:27:05,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:05,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2025-02-07 17:27:05,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:05,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-02-07 17:27:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:06,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:06,912 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 190 treesize of output 182 [2025-02-07 17:27:06,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:06,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3297303 treesize of output 3239959 [2025-02-07 17:27:07,357 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 164 treesize of output 156 [2025-02-07 17:27:07,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1378427 treesize of output 1321083 [2025-02-07 17:27:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:07,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661181] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:07,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:07,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 79 [2025-02-07 17:27:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787023928] [2025-02-07 17:27:07,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:07,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-02-07 17:27:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:07,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-02-07 17:27:07,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=5641, Unknown=0, NotChecked=0, Total=6162 [2025-02-07 17:27:07,474 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 79 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:11,129 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2025-02-07 17:27:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-02-07 17:27:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 32 [2025-02-07 17:27:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:11,130 INFO L225 Difference]: With dead ends: 163 [2025-02-07 17:27:11,130 INFO L226 Difference]: Without dead ends: 145 [2025-02-07 17:27:11,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5008 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1202, Invalid=13318, Unknown=0, NotChecked=0, Total=14520 [2025-02-07 17:27:11,139 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 166 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 701 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 17:27:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-07 17:27:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2025-02-07 17:27:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-02-07 17:27:11,228 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 32 [2025-02-07 17:27:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:11,228 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-02-07 17:27:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-02-07 17:27:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:27:11,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:11,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:11,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 281684527, now seen corresponding path program 3 times [2025-02-07 17:27:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267848726] [2025-02-07 17:27:11,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:27:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:11,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-02-07 17:27:11,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:27:11,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:27:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:27:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267848726] [2025-02-07 17:27:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267848726] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049637365] [2025-02-07 17:27:12,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:27:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:12,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:12,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-07 17:27:12,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-02-07 17:27:12,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:27:12,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:27:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:12,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-02-07 17:27:12,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:12,407 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:12,443 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:12,473 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 19 treesize of output 18 [2025-02-07 17:27:12,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:12,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:27:12,606 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:27:12,659 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 19 treesize of output 18 [2025-02-07 17:27:12,741 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-02-07 17:27:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-02-07 17:27:12,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:12,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:13,035 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-07 17:27:13,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-07 17:27:13,262 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-07 17:27:13,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-02-07 17:27:13,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:27:13,333 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:27:13,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:27:13,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:13,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 29 [2025-02-07 17:27:13,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:13,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2025-02-07 17:27:13,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:13,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-02-07 17:27:13,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-07 17:27:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:13,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:22,746 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 71 treesize of output 67 [2025-02-07 17:27:22,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:22,752 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 678 treesize of output 654 [2025-02-07 17:27:27,052 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 74 treesize of output 68 [2025-02-07 17:27:27,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:27,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1353 treesize of output 1193 [2025-02-07 17:27:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049637365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:27,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 26] total 69 [2025-02-07 17:27:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370677687] [2025-02-07 17:27:27,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:27,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-02-07 17:27:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:27,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-02-07 17:27:27,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=4122, Unknown=3, NotChecked=0, Total=4692 [2025-02-07 17:27:27,125 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 69 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:30,042 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2025-02-07 17:27:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 17:27:30,043 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 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 33 [2025-02-07 17:27:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:30,044 INFO L225 Difference]: With dead ends: 121 [2025-02-07 17:27:30,044 INFO L226 Difference]: Without dead ends: 95 [2025-02-07 17:27:30,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3580 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1230, Invalid=9687, Unknown=3, NotChecked=0, Total=10920 [2025-02-07 17:27:30,045 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:30,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 153 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 17:27:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-07 17:27:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2025-02-07 17:27:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-02-07 17:27:30,079 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 33 [2025-02-07 17:27:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:30,079 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-02-07 17:27:30,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-02-07 17:27:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:27:30,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:30,082 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:30,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-07 17:27:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:30,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1748844696, now seen corresponding path program 11 times [2025-02-07 17:27:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543078791] [2025-02-07 17:27:30,284 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:27:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:30,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-02-07 17:27:30,314 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:27:30,314 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:27:30,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-07 17:27:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543078791] [2025-02-07 17:27:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543078791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388709083] [2025-02-07 17:27:30,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:27:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:30,415 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:30,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-07 17:27:30,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-02-07 17:27:30,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:27:30,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:27:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:30,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 17:27:30,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-07 17:27:30,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-07 17:27:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388709083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:30,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-02-07 17:27:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953677133] [2025-02-07 17:27:30,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 17:27:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:30,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 17:27:30,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-07 17:27:30,819 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:31,144 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2025-02-07 17:27:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 17:27:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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 34 [2025-02-07 17:27:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:31,145 INFO L225 Difference]: With dead ends: 161 [2025-02-07 17:27:31,145 INFO L226 Difference]: Without dead ends: 101 [2025-02-07 17:27:31,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:27:31,147 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 122 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:31,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 120 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-07 17:27:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2025-02-07 17:27:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-02-07 17:27:31,177 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 34 [2025-02-07 17:27:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-02-07 17:27:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2025-02-07 17:27:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:27:31,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:31,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:31,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 17:27:31,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1085484243, now seen corresponding path program 4 times [2025-02-07 17:27:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600350079] [2025-02-07 17:27:31,379 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:27:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:31,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:27:31,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-02-07 17:27:31,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:27:31,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:27:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600350079] [2025-02-07 17:27:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600350079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542986165] [2025-02-07 17:27:32,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:27:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:32,227 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-07 17:27:32,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:27:32,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-02-07 17:27:32,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:27:32,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:32,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-07 17:27:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:32,338 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:27:32,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2025-02-07 17:27:32,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 43 [2025-02-07 17:27:32,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-07 17:27:32,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 53 [2025-02-07 17:27:32,871 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 33 treesize of output 25 [2025-02-07 17:27:32,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 44 [2025-02-07 17:27:32,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 35 [2025-02-07 17:27:32,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:27:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 23 [2025-02-07 17:27:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:27:33,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:37,609 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 146 treesize of output 130 [2025-02-07 17:27:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:27:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542986165] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:38,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 59 [2025-02-07 17:27:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327854318] [2025-02-07 17:27:38,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-07 17:27:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:38,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-07 17:27:38,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2920, Unknown=0, NotChecked=0, Total=3422 [2025-02-07 17:27:38,757 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:41,403 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2025-02-07 17:27:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-07 17:27:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 17:27:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:41,404 INFO L225 Difference]: With dead ends: 132 [2025-02-07 17:27:41,404 INFO L226 Difference]: Without dead ends: 130 [2025-02-07 17:27:41,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3076 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1595, Invalid=8305, Unknown=0, NotChecked=0, Total=9900 [2025-02-07 17:27:41,405 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:41,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 175 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 17:27:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-07 17:27:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 70. [2025-02-07 17:27:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2025-02-07 17:27:41,439 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2025-02-07 17:27:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:41,439 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2025-02-07 17:27:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2025-02-07 17:27:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 17:27:41,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:41,439 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:41,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-07 17:27:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 17:27:41,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -427990289, now seen corresponding path program 12 times [2025-02-07 17:27:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172606613] [2025-02-07 17:27:41,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:27:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:41,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-02-07 17:27:41,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 17:27:41,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-07 17:27:41,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat