./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/splice-2.i -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 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:38:00,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:38:00,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:38:00,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:38:00,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:38:00,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:38:00,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:38:00,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:38:00,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:38:00,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:38:00,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:38:00,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:38:00,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:38:00,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:38:00,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:38:00,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:00,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:38:00,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:38:00,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:38:00,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:38:00,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:38:00,250 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2025-02-05 14:38:00,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:38:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:38:00,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:38:00,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:38:00,520 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:38:00,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/splice-2.i [2025-02-05 14:38:01,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf8c58d05/8e8ba70f687649fea1aa7e3c3db8b4fe/FLAG396cf2e30 [2025-02-05 14:38:01,973 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:38:01,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i [2025-02-05 14:38:01,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf8c58d05/8e8ba70f687649fea1aa7e3c3db8b4fe/FLAG396cf2e30 [2025-02-05 14:38:02,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf8c58d05/8e8ba70f687649fea1aa7e3c3db8b4fe [2025-02-05 14:38:02,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:38:02,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:38:02,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:02,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:38:02,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:38:02,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da8697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02, skipping insertion in model container [2025-02-05 14:38:02,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:38:02,595 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/list-properties/splice-2.i[23721,23734] [2025-02-05 14:38:02,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:02,611 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:38:02,659 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/list-properties/splice-2.i[23721,23734] [2025-02-05 14:38:02,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:02,691 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:38:02,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02 WrapperNode [2025-02-05 14:38:02,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:02,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:02,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:38:02,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:38:02,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,722 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 96 [2025-02-05 14:38:02,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:02,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:38:02,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:38:02,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:38:02,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,744 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-05 14:38:02,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:38:02,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:38:02,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:38:02,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:38:02,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (1/1) ... [2025-02-05 14:38:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:02,780 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-05 14:38:02,784 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-05 14:38:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-05 14:38:02,801 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:38:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:38:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:38:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:38:02,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:38:02,889 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:38:02,890 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:38:02,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-05 14:38:03,092 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-05 14:38:03,092 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:38:03,106 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:38:03,106 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:38:03,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:03 BoogieIcfgContainer [2025-02-05 14:38:03,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:38:03,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:38:03,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:38:03,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:38:03,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:38:02" (1/3) ... [2025-02-05 14:38:03,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e37dce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:03, skipping insertion in model container [2025-02-05 14:38:03,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:02" (2/3) ... [2025-02-05 14:38:03,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e37dce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:03, skipping insertion in model container [2025-02-05 14:38:03,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:03" (3/3) ... [2025-02-05 14:38:03,118 INFO L128 eAbstractionObserver]: Analyzing ICFG splice-2.i [2025-02-05 14:38:03,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:38:03,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG splice-2.i that has 2 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:38:03,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:38:03,251 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;@4032f1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:38:03,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:38:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:38:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:38:03,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:03,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:03,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:03,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1073334624, now seen corresponding path program 1 times [2025-02-05 14:38:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571742918] [2025-02-05 14:38:03,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:03,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:38:03,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:38:03,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:03,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:03,395 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-05 14:38:03,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571742918] [2025-02-05 14:38:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571742918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:38:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446092093] [2025-02-05 14:38:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:38:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:38:03,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:38:03,420 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 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-05 14:38:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:03,430 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2025-02-05 14:38:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:38:03,432 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-05 14:38:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:03,435 INFO L225 Difference]: With dead ends: 44 [2025-02-05 14:38:03,436 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 14:38:03,438 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-05 14:38:03,439 INFO L435 NwaCegarLoop]: 38 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, 38 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-05 14:38:03,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 14:38:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-05 14:38:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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-05 14:38:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-02-05 14:38:03,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2025-02-05 14:38:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-02-05 14:38:03,461 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-05 14:38:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-02-05 14:38:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 14:38:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:03,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:03,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:38:03,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1776656596, now seen corresponding path program 1 times [2025-02-05 14:38:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571307100] [2025-02-05 14:38:03,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 14:38:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 14:38:03,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:03,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:03,609 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-05 14:38:03,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:03,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571307100] [2025-02-05 14:38:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571307100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:38:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493966787] [2025-02-05 14:38:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:03,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:38:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:03,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:38:03,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:38:03,613 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 14:38:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:03,654 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-02-05 14:38:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:38:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-02-05 14:38:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:03,655 INFO L225 Difference]: With dead ends: 33 [2025-02-05 14:38:03,655 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 14:38:03,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:38:03,656 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:03,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 14:38:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 14:38:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 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-05 14:38:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-05 14:38:03,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-02-05 14:38:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:03,660 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-05 14:38:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-05 14:38:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-05 14:38:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:38:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:03,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:38:03,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 758037944, now seen corresponding path program 1 times [2025-02-05 14:38:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972330246] [2025-02-05 14:38:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:03,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:38:03,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:38:03,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:03,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:03,732 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-05 14:38:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972330246] [2025-02-05 14:38:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972330246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:38:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389402523] [2025-02-05 14:38:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:38:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:38:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:38:03,734 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 14:38:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:03,776 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-02-05 14:38:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:38:03,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:38:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:03,778 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:38:03,779 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 14:38:03,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:38:03,780 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:03,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 14:38:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 14:38:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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-05 14:38:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-05 14:38:03,784 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 15 [2025-02-05 14:38:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:03,784 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-05 14:38:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 14:38:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-05 14:38:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:38:03,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:03,785 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:03,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:38:03,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1373494479, now seen corresponding path program 1 times [2025-02-05 14:38:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727389640] [2025-02-05 14:38:03,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:38:03,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:38:03,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:03,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727389640] [2025-02-05 14:38:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727389640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:38:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093264377] [2025-02-05 14:38:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:04,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:38:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:04,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:38:04,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:38:04,039 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:38:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:04,096 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-02-05 14:38:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:38:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 14:38:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:04,097 INFO L225 Difference]: With dead ends: 68 [2025-02-05 14:38:04,097 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 14:38:04,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:38:04,098 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:04,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 14:38:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-02-05 14:38:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 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-05 14:38:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-02-05 14:38:04,105 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 17 [2025-02-05 14:38:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:04,105 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-02-05 14:38:04,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:38:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-02-05 14:38:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:38:04,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:04,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:04,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:38:04,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2065315019, now seen corresponding path program 1 times [2025-02-05 14:38:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957365350] [2025-02-05 14:38:04,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:04,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:38:04,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:38:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957365350] [2025-02-05 14:38:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957365350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077466716] [2025-02-05 14:38:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:04,622 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-05 14:38:04,638 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-05 14:38:04,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:38:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:38:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:04,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 14:38:04,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:04,821 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-05 14:38:04,907 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 23 treesize of output 11 [2025-02-05 14:38:04,972 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-05 14:38:04,973 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 1 case distinctions, treesize of input 19 treesize of output 22 [2025-02-05 14:38:05,127 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:38:05,128 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 21 [2025-02-05 14:38:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:05,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:05,527 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 207 treesize of output 199 [2025-02-05 14:38:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077466716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:05,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 26 [2025-02-05 14:38:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827307402] [2025-02-05 14:38:05,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 14:38:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:05,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 14:38:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-02-05 14:38:05,596 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-05 14:38:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:05,955 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2025-02-05 14:38:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 14:38:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) Word has length 23 [2025-02-05 14:38:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:05,955 INFO L225 Difference]: With dead ends: 87 [2025-02-05 14:38:05,955 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 14:38:05,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 14:38:05,956 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:05,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:38:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 14:38:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2025-02-05 14:38:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 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-05 14:38:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2025-02-05 14:38:05,961 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 23 [2025-02-05 14:38:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:05,961 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2025-02-05 14:38:05,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-05 14:38:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2025-02-05 14:38:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:38:05,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:05,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:05,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:38:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:06,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -712005322, now seen corresponding path program 1 times [2025-02-05 14:38:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832882416] [2025-02-05 14:38:06,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:38:06,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:38:06,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:06,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:38:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832882416] [2025-02-05 14:38:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832882416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:38:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084093250] [2025-02-05 14:38:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:06,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:38:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:06,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:38:06,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:06,197 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-05 14:38:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:06,213 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2025-02-05 14:38:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:38:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-05 14:38:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:06,215 INFO L225 Difference]: With dead ends: 112 [2025-02-05 14:38:06,215 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 14:38:06,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:06,215 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:06,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 14:38:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2025-02-05 14:38:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 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-05 14:38:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-02-05 14:38:06,236 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 23 [2025-02-05 14:38:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:06,236 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-02-05 14:38:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-05 14:38:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-02-05 14:38:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:38:06,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:06,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:06,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:38:06,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -492767914, now seen corresponding path program 1 times [2025-02-05 14:38:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356632591] [2025-02-05 14:38:06,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:06,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:38:06,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:38:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356632591] [2025-02-05 14:38:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356632591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178032532] [2025-02-05 14:38:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:06,574 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-05 14:38:06,594 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-05 14:38:06,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:38:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:38:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:06,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 14:38:06,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:06,671 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 13 treesize of output 9 [2025-02-05 14:38:06,674 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 13 treesize of output 9 [2025-02-05 14:38:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:38:06,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:38:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178032532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:06,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2025-02-05 14:38:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040036940] [2025-02-05 14:38:06,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:38:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:06,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:38:06,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:38:06,745 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-05 14:38:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:06,829 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-02-05 14:38:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:38:06,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-05 14:38:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:06,829 INFO L225 Difference]: With dead ends: 82 [2025-02-05 14:38:06,829 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 14:38:06,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:38:06,830 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:06,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:38:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 14:38:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-02-05 14:38:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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-05 14:38:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2025-02-05 14:38:06,834 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 25 [2025-02-05 14:38:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:06,834 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-02-05 14:38:06,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-05 14:38:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2025-02-05 14:38:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:38:06,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:06,835 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:06,842 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-05 14:38:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:07,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:07,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash 474941478, now seen corresponding path program 2 times [2025-02-05 14:38:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:07,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309582845] [2025-02-05 14:38:07,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:38:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:07,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 14:38:07,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:38:07,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:38:07,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:38:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309582845] [2025-02-05 14:38:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309582845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:38:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567426136] [2025-02-05 14:38:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:38:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:38:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:07,093 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-05 14:38:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:07,107 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2025-02-05 14:38:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:38:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 26 [2025-02-05 14:38:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:07,109 INFO L225 Difference]: With dead ends: 125 [2025-02-05 14:38:07,109 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 14:38:07,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:07,110 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 14:38:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2025-02-05 14:38:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 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-05 14:38:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-02-05 14:38:07,115 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 26 [2025-02-05 14:38:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-02-05 14:38:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-05 14:38:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-02-05 14:38:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:38:07,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:07,116 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:07,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:38:07,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:07,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1362445159, now seen corresponding path program 1 times [2025-02-05 14:38:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017933445] [2025-02-05 14:38:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:07,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:38:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:38:07,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:07,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017933445] [2025-02-05 14:38:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017933445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706834932] [2025-02-05 14:38:07,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:07,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:07,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:07,615 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-05 14:38:07,618 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-05 14:38:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:38:07,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:38:07,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:07,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 14:38:07,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:07,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-05 14:38:07,774 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-05 14:38:07,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:38:07,818 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 11 treesize of output 11 [2025-02-05 14:38:07,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 14:38:07,857 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 23 treesize of output 11 [2025-02-05 14:38:07,915 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:38:07,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-05 14:38:07,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:38:07,941 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 16 treesize of output 8 [2025-02-05 14:38:07,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 14:38:08,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:38:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:08,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:08,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2025-02-05 14:38:08,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1) (not (= v_ArrVal_300 (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base|) .cse0 (select v_ArrVal_300 .cse0))))))) is different from false [2025-02-05 14:38:08,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_300 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_300 .cse0)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_300) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_301) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) is different from false [2025-02-05 14:38:08,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_300 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0 (select v_ArrVal_300 .cse0))))))) is different from false [2025-02-05 14:38:08,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_299)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select v_ArrVal_300 .cse1)) v_ArrVal_300)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2025-02-05 14:38:08,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:08,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-02-05 14:38:08,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:08,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 82 treesize of output 81 [2025-02-05 14:38:08,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-02-05 14:38:08,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse4 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (and (forall ((v_ArrVal_295 Int) (v_arrayElimCell_14 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse3 v_ArrVal_295)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_299))) (or (not (= v_ArrVal_300 (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select v_ArrVal_300 .cse1)))) (forall ((v_ArrVal_301 (Array Int Int))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300))) (or (= (select (select (store .cse9 v_arrayElimCell_14 v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_16 Int)) (= (select (select (store .cse9 v_arrayElimCell_16 v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))) (or (forall ((v_ArrVal_295 Int) (v_arrayElimCell_14 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse3 v_ArrVal_295)))) (or (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) v_arrayElimCell_14 v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_300 (store (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select v_ArrVal_300 .cse1))))))) .cse4)))) (and (or (forall ((v_ArrVal_295 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse3 v_ArrVal_295)))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_300 (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select v_ArrVal_300 .cse1))))))) .cse4) (or (not .cse4) (forall ((v_ArrVal_295 Int) (v_arrayElimCell_16 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (or (not (= v_ArrVal_300 (store v_ArrVal_299 .cse1 (select v_ArrVal_300 .cse1)))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse3 v_ArrVal_295)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) v_arrayElimCell_16 v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse5) (or .cse5 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_295 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse3 v_ArrVal_295)))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_299))) (or (not (= v_ArrVal_300 (store (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select v_ArrVal_300 .cse1)))) (forall ((v_ArrVal_301 (Array Int Int))) (or (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_16 Int)) (= (select (select (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_300) v_arrayElimCell_16 v_ArrVal_301) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))) is different from false [2025-02-05 14:38:08,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-05 14:38:08,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:08,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 66 [2025-02-05 14:38:08,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:08,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 85 treesize of output 89 [2025-02-05 14:38:08,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:08,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-02-05 14:38:08,989 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 19 treesize of output 15 [2025-02-05 14:38:09,001 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 12 treesize of output 8 [2025-02-05 14:38:09,017 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 6 treesize of output 4 [2025-02-05 14:38:09,043 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-02-05 14:38:09,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 43 [2025-02-05 14:38:09,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,058 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 29 treesize of output 33 [2025-02-05 14:38:09,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,077 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 31 treesize of output 35 [2025-02-05 14:38:09,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 47 [2025-02-05 14:38:09,109 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:09,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2025-02-05 14:38:09,121 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 5 treesize of output 3 [2025-02-05 14:38:09,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,129 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 16 treesize of output 20 [2025-02-05 14:38:09,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2025-02-05 14:38:09,146 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:09,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-02-05 14:38:09,151 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 6 treesize of output 4 [2025-02-05 14:38:09,154 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 19 treesize of output 15 [2025-02-05 14:38:09,158 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 21 treesize of output 17 [2025-02-05 14:38:09,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 50 [2025-02-05 14:38:09,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:09,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-02-05 14:38:09,179 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 6 treesize of output 4 [2025-02-05 14:38:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-05 14:38:09,189 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 9 treesize of output 7 [2025-02-05 14:38:09,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2025-02-05 14:38:09,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:09,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 62 treesize of output 66 [2025-02-05 14:38:09,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-02-05 14:38:09,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:09,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:09,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 50 [2025-02-05 14:38:09,250 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:09,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:09,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2025-02-05 14:38:09,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-05 14:38:09,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-02-05 14:38:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706834932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:09,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2025-02-05 14:38:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175570406] [2025-02-05 14:38:09,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 14:38:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:09,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 14:38:09,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=661, Unknown=15, NotChecked=342, Total=1122 [2025-02-05 14:38:09,375 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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-05 14:38:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:09,902 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-02-05 14:38:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 14:38:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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) Word has length 26 [2025-02-05 14:38:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:09,903 INFO L225 Difference]: With dead ends: 79 [2025-02-05 14:38:09,903 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 14:38:09,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1163, Unknown=18, NotChecked=450, Total=1806 [2025-02-05 14:38:09,904 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 76 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:09,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 218 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 379 Invalid, 0 Unknown, 377 Unchecked, 0.3s Time] [2025-02-05 14:38:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 14:38:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-02-05 14:38:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 72 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-05 14:38:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-02-05 14:38:09,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 26 [2025-02-05 14:38:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:09,908 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-02-05 14:38:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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-05 14:38:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-02-05 14:38:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:38:09,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:09,909 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:09,920 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-05 14:38:10,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:10,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -714055459, now seen corresponding path program 1 times [2025-02-05 14:38:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826419888] [2025-02-05 14:38:10,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:10,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:38:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:38:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:38:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826419888] [2025-02-05 14:38:10,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826419888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6192887] [2025-02-05 14:38:10,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:10,170 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-05 14:38:10,179 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-05 14:38:10,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:38:10,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:38:10,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:10,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:10,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 14:38:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:38:10,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:38:10,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6192887] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:10,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:10,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-05 14:38:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2703714] [2025-02-05 14:38:10,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:10,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:38:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:10,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:38:10,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:38:10,293 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-05 14:38:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:10,348 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2025-02-05 14:38:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:38:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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 27 [2025-02-05 14:38:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:10,349 INFO L225 Difference]: With dead ends: 86 [2025-02-05 14:38:10,349 INFO L226 Difference]: Without dead ends: 82 [2025-02-05 14:38:10,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:38:10,350 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:10,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-05 14:38:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-02-05 14:38:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.155844155844156) internal successors, (89), 77 states have internal predecessors, (89), 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-05 14:38:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-02-05 14:38:10,355 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2025-02-05 14:38:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:10,355 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-02-05 14:38:10,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-05 14:38:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-02-05 14:38:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 14:38:10,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:10,356 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:10,362 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-05 14:38:10,556 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,SelfDestructingSolverStorable9 [2025-02-05 14:38:10,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:10,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash -655152888, now seen corresponding path program 1 times [2025-02-05 14:38:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640626557] [2025-02-05 14:38:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 14:38:10,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 14:38:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:10,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:38:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640626557] [2025-02-05 14:38:10,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640626557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130584062] [2025-02-05 14:38:10,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:10,906 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-05 14:38:10,907 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-05 14:38:10,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 14:38:10,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 14:38:10,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:10,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:10,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-05 14:38:10,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:10,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-05 14:38:11,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:38:11,047 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 11 treesize of output 11 [2025-02-05 14:38:11,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 14:38:11,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:38:11,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-05 14:38:11,188 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-05 14:38:11,192 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 15 [2025-02-05 14:38:11,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:38:11,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:38:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:11,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:11,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~l1~0#1.offset| 4))) (and (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_446 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)))) is different from false [2025-02-05 14:38:11,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~l1~0#1.offset| 4))) (and (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_446 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)))) is different from false [2025-02-05 14:38:11,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:11,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-05 14:38:11,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-05 14:38:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:38:11,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:11,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-02-05 14:38:11,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:11,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 38 [2025-02-05 14:38:11,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-05 14:38:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-02-05 14:38:11,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130584062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:11,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:11,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 34 [2025-02-05 14:38:11,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335747458] [2025-02-05 14:38:11,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:11,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 14:38:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:11,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 14:38:11,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=896, Unknown=10, NotChecked=122, Total=1122 [2025-02-05 14:38:11,965 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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-05 14:38:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:12,512 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-02-05 14:38:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:38:12,513 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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 28 [2025-02-05 14:38:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:12,513 INFO L225 Difference]: With dead ends: 94 [2025-02-05 14:38:12,513 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 14:38:12,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=1623, Unknown=11, NotChecked=166, Total=1980 [2025-02-05 14:38:12,514 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 290 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 411 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2025-02-05 14:38:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 14:38:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-02-05 14:38:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 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-05 14:38:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-05 14:38:12,521 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 28 [2025-02-05 14:38:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:12,521 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-05 14:38:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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-05 14:38:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-05 14:38:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:38:12,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:12,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:12,540 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-05 14:38:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 14:38:12,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 438173216, now seen corresponding path program 1 times [2025-02-05 14:38:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755101586] [2025-02-05 14:38:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:12,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:38:12,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:38:12,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:12,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:13,408 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-05 14:38:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755101586] [2025-02-05 14:38:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755101586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763966117] [2025-02-05 14:38:13,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:13,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:13,413 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-05 14:38:13,417 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-05 14:38:13,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:38:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:38:13,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:13,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:13,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-05 14:38:13,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:13,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-05 14:38:13,561 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-05 14:38:13,600 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:38:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:38:13,676 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 23 treesize of output 11 [2025-02-05 14:38:13,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 14:38:13,736 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-05 14:38:13,736 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 1 case distinctions, treesize of input 33 treesize of output 24 [2025-02-05 14:38:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:38:13,760 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-05 14:38:13,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-05 14:38:13,818 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-02-05 14:38:13,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 67 [2025-02-05 14:38:13,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:38:13,904 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2025-02-05 14:38:13,904 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 77 [2025-02-05 14:38:13,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2025-02-05 14:38:14,039 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:38:14,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2025-02-05 14:38:14,082 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:38:14,083 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 30 treesize of output 21 [2025-02-05 14:38:14,185 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:38:14,185 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 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-05 14:38:14,256 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-05 14:38:14,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:14,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_561) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2025-02-05 14:38:14,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_561) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1) (not (= v_ArrVal_560 (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base|) .cse0 (select v_ArrVal_560 .cse0))))))) is different from false [2025-02-05 14:38:14,332 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_560 .cse0)) v_ArrVal_560)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_560) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_561) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2025-02-05 14:38:14,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_560 .cse1)) v_ArrVal_560)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_560) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) v_ArrVal_561) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2025-02-05 14:38:14,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_560) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (store .cse1 .cse0 (select v_ArrVal_560 .cse0)) v_ArrVal_560))))) (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2025-02-05 14:38:14,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_560) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_557) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_560 (store .cse2 .cse1 (select v_ArrVal_560 .cse1))))))) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2025-02-05 14:38:14,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_553))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_45| (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_45|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_560) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |v_ULTIMATE.start_main_~t~0#1.base_45|)) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_557) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)) (not (= v_ArrVal_560 (store .cse0 .cse2 (select v_ArrVal_560 .cse2)))))))) is different from false [2025-02-05 14:38:14,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:14,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2025-02-05 14:38:14,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_12 (+ |ULTIMATE.start_main_~p~0#1.offset| 4)))) (let ((.cse3 (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_553))) (store .cse4 .cse0 (store (select .cse4 .cse0) 0 3))))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= v_ArrVal_560 (store .cse1 .cse2 (select v_ArrVal_560 .cse2)))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_560) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse0 v_ArrVal_557) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) is different from false [2025-02-05 14:38:14,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:14,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2025-02-05 14:38:14,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:14,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 294 treesize of output 293 [2025-02-05 14:38:14,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:14,716 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 394 treesize of output 330 [2025-02-05 14:38:14,723 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 226 treesize of output 218 [2025-02-05 14:38:34,035 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:34,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 197 treesize of output 165 [2025-02-05 14:38:34,047 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:34,051 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:34,186 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2025-02-05 14:38:34,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 152 [2025-02-05 14:38:34,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:34,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:34,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 89 [2025-02-05 14:38:34,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-02-05 14:38:34,430 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 11 treesize of output 7 [2025-02-05 14:38:34,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:34,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2025-02-05 14:38:34,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:34,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 142 [2025-02-05 14:38:34,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:34,859 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 107 treesize of output 113 [2025-02-05 14:38:35,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 66 [2025-02-05 14:38:35,090 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 58 [2025-02-05 14:38:35,113 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 9 treesize of output 7 [2025-02-05 14:38:35,121 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 6 treesize of output 4 [2025-02-05 14:38:35,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,131 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 24 treesize of output 28 [2025-02-05 14:38:35,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 82 [2025-02-05 14:38:35,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 77 [2025-02-05 14:38:35,181 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 19 treesize of output 15 [2025-02-05 14:38:35,189 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 6 treesize of output 4 [2025-02-05 14:38:35,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,212 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 24 treesize of output 28 [2025-02-05 14:38:35,287 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:35,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 130 [2025-02-05 14:38:35,293 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,294 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,329 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2025-02-05 14:38:35,329 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 4 case distinctions, treesize of input 73 treesize of output 70 [2025-02-05 14:38:35,333 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 77 [2025-02-05 14:38:35,378 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 11 treesize of output 7 [2025-02-05 14:38:35,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2025-02-05 14:38:35,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,486 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 56 treesize of output 62 [2025-02-05 14:38:35,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 79 [2025-02-05 14:38:35,595 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,596 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2025-02-05 14:38:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-05 14:38:35,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:35,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 14:38:35,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 136 [2025-02-05 14:38:35,661 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 397 treesize of output 395 [2025-02-05 14:38:35,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 121 [2025-02-05 14:38:35,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-02-05 14:38:35,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:35,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:38:35,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-05 14:38:35,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:38:35,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-02-05 14:38:35,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 114 [2025-02-05 14:38:35,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,922 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:35,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 130 [2025-02-05 14:38:35,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-02-05 14:38:35,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:36,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:36,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2025-02-05 14:38:36,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 103 [2025-02-05 14:38:36,123 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:36,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 108 [2025-02-05 14:38:36,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-05 14:38:36,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-02-05 14:38:36,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:36,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:38:36,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-05 14:38:36,293 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:36,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 232 treesize of output 187 [2025-02-05 14:38:36,299 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:36,372 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2025-02-05 14:38:36,372 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 6 case distinctions, treesize of input 244 treesize of output 253 [2025-02-05 14:38:36,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 123 [2025-02-05 14:38:36,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 103 [2025-02-05 14:38:36,451 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 28 treesize of output 22 [2025-02-05 14:38:36,524 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 12 treesize of output 8 [2025-02-05 14:38:36,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-02-05 14:38:36,649 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 11 treesize of output 7 [2025-02-05 14:38:36,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,669 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 101 treesize of output 107 [2025-02-05 14:38:36,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,886 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 60 treesize of output 56 [2025-02-05 14:38:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:36,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:36,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-02-05 14:38:36,980 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-02-05 14:38:36,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 100 [2025-02-05 14:38:37,006 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 21 treesize of output 17 [2025-02-05 14:38:37,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,029 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 30 treesize of output 32 [2025-02-05 14:38:37,236 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:37,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 120 [2025-02-05 14:38:37,246 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:37,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 118 [2025-02-05 14:38:37,258 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 16 treesize of output 12 [2025-02-05 14:38:37,260 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 9 treesize of output 7 [2025-02-05 14:38:37,278 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 6 treesize of output 4 [2025-02-05 14:38:37,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,289 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 21 treesize of output 25 [2025-02-05 14:38:37,358 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:37,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 132 treesize of output 139 [2025-02-05 14:38:37,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:37,376 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:38:37,377 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 2 case distinctions, treesize of input 83 treesize of output 65 [2025-02-05 14:38:37,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 82 [2025-02-05 14:38:37,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-02-05 14:38:37,539 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 26 treesize of output 20 [2025-02-05 14:38:37,550 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 19 treesize of output 15 [2025-02-05 14:38:37,817 INFO L349 Elim1Store]: treesize reduction 34, result has 66.3 percent of original size [2025-02-05 14:38:37,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 154 [2025-02-05 14:38:37,823 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:37,855 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2025-02-05 14:38:37,856 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 4 case distinctions, treesize of input 129 treesize of output 126 [2025-02-05 14:38:37,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 91 [2025-02-05 14:38:37,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-05 14:38:37,908 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 19 treesize of output 15 [2025-02-05 14:38:37,960 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 12 treesize of output 8 [2025-02-05 14:38:37,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-02-05 14:38:38,006 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 11 treesize of output 7 [2025-02-05 14:38:38,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,028 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 62 treesize of output 72 [2025-02-05 14:38:38,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-02-05 14:38:38,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 66 [2025-02-05 14:38:38,178 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2025-02-05 14:38:38,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-05 14:38:38,210 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 6 treesize of output 4 [2025-02-05 14:38:38,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,219 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 24 treesize of output 28 [2025-02-05 14:38:38,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 79 [2025-02-05 14:38:38,250 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,251 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-02-05 14:38:38,264 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 6 treesize of output 4 [2025-02-05 14:38:38,267 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 9 treesize of output 7 [2025-02-05 14:38:38,272 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 16 treesize of output 12 [2025-02-05 14:38:38,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 136 [2025-02-05 14:38:38,293 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 221 treesize of output 223 [2025-02-05 14:38:38,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 123 [2025-02-05 14:38:38,336 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 28 treesize of output 22 [2025-02-05 14:38:38,350 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 6 treesize of output 4 [2025-02-05 14:38:38,431 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 5 treesize of output 3 [2025-02-05 14:38:38,454 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 5 treesize of output 3 [2025-02-05 14:38:38,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,469 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 38 treesize of output 40 [2025-02-05 14:38:38,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 114 [2025-02-05 14:38:38,569 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 122 [2025-02-05 14:38:38,627 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 19 treesize of output 15 [2025-02-05 14:38:38,643 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 6 treesize of output 4 [2025-02-05 14:38:38,680 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 5 treesize of output 3 [2025-02-05 14:38:38,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,700 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 29 treesize of output 33 [2025-02-05 14:38:38,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 103 [2025-02-05 14:38:38,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:38:38,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 100 [2025-02-05 14:38:38,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:38:38,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-05 14:38:38,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:38,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2025-02-05 14:38:38,862 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 19 treesize of output 15 [2025-02-05 14:38:38,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2025-02-05 14:38:38,996 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 5 treesize of output 3 [2025-02-05 14:38:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2025-02-05 14:38:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763966117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:38:57,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:38:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 47 [2025-02-05 14:38:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478169489] [2025-02-05 14:38:57,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:57,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 14:38:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:57,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 14:38:57,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1321, Unknown=25, NotChecked=648, Total=2162 [2025-02-05 14:38:57,981 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 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-05 14:39:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:41,069 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-02-05 14:39:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 14:39:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 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-05 14:39:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:41,074 INFO L225 Difference]: With dead ends: 103 [2025-02-05 14:39:41,074 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 14:39:41,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=333, Invalid=2864, Unknown=27, NotChecked=936, Total=4160 [2025-02-05 14:39:41,075 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 93 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:41,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 372 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 721 Invalid, 0 Unknown, 690 Unchecked, 22.0s Time] [2025-02-05 14:39:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 14:39:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2025-02-05 14:39:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 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-05 14:39:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-02-05 14:39:41,084 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 32 [2025-02-05 14:39:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:41,084 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-02-05 14:39:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 47 states have internal predecessors, (86), 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-05 14:39:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-02-05 14:39:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:39:41,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:41,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:41,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 14:39:41,285 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,SelfDestructingSolverStorable11 [2025-02-05 14:39:41,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:41,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:41,286 INFO L85 PathProgramCache]: Analyzing trace with hash 177740161, now seen corresponding path program 1 times [2025-02-05 14:39:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302951618] [2025-02-05 14:39:41,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:41,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:39:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:39:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat