./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/running_example.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/heap-data/running_example.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 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:13,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:13,953 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:32:13,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:13,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:13,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:13,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:13,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:13,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:13,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:13,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:13,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:13,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:13,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:13,982 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:13,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:13,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:13,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:13,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:32:13,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:32:13,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:13,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:13,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:13,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:13,985 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 -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2025-02-05 14:32:14,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:14,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:14,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:14,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:14,232 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:14,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/running_example.i [2025-02-05 14:32:15,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94c27a24/e884316fdaa04d19ba16b5f4263fb9c3/FLAGb222a8640 [2025-02-05 14:32:15,646 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:15,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i [2025-02-05 14:32:15,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94c27a24/e884316fdaa04d19ba16b5f4263fb9c3/FLAGb222a8640 [2025-02-05 14:32:15,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94c27a24/e884316fdaa04d19ba16b5f4263fb9c3 [2025-02-05 14:32:15,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:15,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:15,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:15,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:15,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:15,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:15" (1/1) ... [2025-02-05 14:32:15,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec30da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:15, skipping insertion in model container [2025-02-05 14:32:15,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:15" (1/1) ... [2025-02-05 14:32:15,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:16,161 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/heap-data/running_example.i[23610,23623] [2025-02-05 14:32:16,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:16,174 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:16,208 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/heap-data/running_example.i[23610,23623] [2025-02-05 14:32:16,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:16,237 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:16,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16 WrapperNode [2025-02-05 14:32:16,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:16,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:16,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:16,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:16,244 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:32:16" (1/1) ... [2025-02-05 14:32:16,256 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:32:16" (1/1) ... [2025-02-05 14:32:16,272 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-02-05 14:32:16,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:16,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:16,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:16,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:16,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,294 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-05 14:32:16,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:16,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:16,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:16,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:16,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (1/1) ... [2025-02-05 14:32:16,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:16,345 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:32:16,347 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:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:32:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:32:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:16,428 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:16,430 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:16,528 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:16,528 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:16,533 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:16,533 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:16,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:16 BoogieIcfgContainer [2025-02-05 14:32:16,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:16,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:16,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:16,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:16,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:15" (1/3) ... [2025-02-05 14:32:16,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aafb5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:16, skipping insertion in model container [2025-02-05 14:32:16,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:16" (2/3) ... [2025-02-05 14:32:16,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aafb5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:16, skipping insertion in model container [2025-02-05 14:32:16,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:16" (3/3) ... [2025-02-05 14:32:16,540 INFO L128 eAbstractionObserver]: Analyzing ICFG running_example.i [2025-02-05 14:32:16,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:16,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG running_example.i that has 1 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 14:32:16,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:16,601 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;@214b1898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:16,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:32:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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:32:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:32:16,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:16,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:16,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:16,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:16,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1303909456, now seen corresponding path program 1 times [2025-02-05 14:32:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118484570] [2025-02-05 14:32:16,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:16,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:32:16,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:32:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:16,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:16,769 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:32:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118484570] [2025-02-05 14:32:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118484570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:16,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:16,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:32:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040128517] [2025-02-05 14:32:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:16,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:32:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:16,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:32:16,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:16,800 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:16,812 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2025-02-05 14:32:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:32:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:32:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:16,818 INFO L225 Difference]: With dead ends: 27 [2025-02-05 14:32:16,818 INFO L226 Difference]: Without dead ends: 15 [2025-02-05 14:32:16,820 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:32:16,824 INFO L435 NwaCegarLoop]: 20 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, 20 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:32:16,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-05 14:32:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-05 14:32:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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:32:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-02-05 14:32:16,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 8 [2025-02-05 14:32:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:16,853 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-05 14:32:16,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-02-05 14:32:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:32:16,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:16,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:32:16,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:16,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 821995795, now seen corresponding path program 1 times [2025-02-05 14:32:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139461637] [2025-02-05 14:32:16,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:32:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:32:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:16,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:17,069 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:32:17,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:17,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139461637] [2025-02-05 14:32:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139461637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:17,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:32:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051102386] [2025-02-05 14:32:17,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:17,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:32:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:17,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:32:17,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:17,072 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:32:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:17,160 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2025-02-05 14:32:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:32:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2025-02-05 14:32:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:17,161 INFO L225 Difference]: With dead ends: 35 [2025-02-05 14:32:17,161 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 14:32:17,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:32:17,162 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:17,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 14:32:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-02-05 14:32:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-05 14:32:17,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2025-02-05 14:32:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-05 14:32:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:32:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-05 14:32:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 14:32:17,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:17,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:17,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:32:17,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 541087822, now seen corresponding path program 1 times [2025-02-05 14:32:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002072472] [2025-02-05 14:32:17,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:17,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 14:32:17,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 14:32:17,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:17,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002072472] [2025-02-05 14:32:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002072472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752317488] [2025-02-05 14:32:17,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:17,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:17,448 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:32:17,450 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:32:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 14:32:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 14:32:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:17,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 14:32:17,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:17,604 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 15 treesize of output 1 [2025-02-05 14:32:17,609 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:32:17,707 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 39 treesize of output 22 [2025-02-05 14:32:17,711 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 11 treesize of output 7 [2025-02-05 14:32:17,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:17,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-02-05 14:32:17,776 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 15 treesize of output 7 [2025-02-05 14:32:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:17,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:17,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_89 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_17| Int) (v_ArrVal_90 (Array Int Int))) (or (< 9 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_89) |v_ULTIMATE.start_main_~p~0#1.base_17| v_ArrVal_90) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_17|) 0)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_89 .cse0))) v_ArrVal_89)))) is different from false [2025-02-05 14:32:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-05 14:32:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752317488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:17,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-02-05 14:32:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831376794] [2025-02-05 14:32:17,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:17,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:17,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-02-05 14:32:17,882 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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:32:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:18,146 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. [2025-02-05 14:32:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 14:32:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:18,148 INFO L225 Difference]: With dead ends: 80 [2025-02-05 14:32:18,148 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 14:32:18,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=290, Unknown=1, NotChecked=38, Total=462 [2025-02-05 14:32:18,150 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 121 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:18,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 109 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 81 Unchecked, 0.1s Time] [2025-02-05 14:32:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 14:32:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 36. [2025-02-05 14:32:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2025-02-05 14:32:18,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 14 [2025-02-05 14:32:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2025-02-05 14:32:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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:32:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2025-02-05 14:32:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 14:32:18,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:18,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:18,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:18,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -431755092, now seen corresponding path program 1 times [2025-02-05 14:32:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560756892] [2025-02-05 14:32:18,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:18,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 14:32:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 14:32:18,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:18,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560756892] [2025-02-05 14:32:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560756892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737692796] [2025-02-05 14:32:18,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:18,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:18,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:18,518 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:32:18,520 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:32:18,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 14:32:18,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 14:32:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:18,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 14:32:18,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:18,586 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 18 treesize of output 7 [2025-02-05 14:32:18,591 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 18 treesize of output 7 [2025-02-05 14:32:18,662 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:32:18,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 14:32:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:18,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737692796] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:18,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 14:32:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117275451] [2025-02-05 14:32:18,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:32:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:18,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:32:18,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:32:18,748 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:32:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:18,828 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2025-02-05 14:32:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 16 [2025-02-05 14:32:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:18,829 INFO L225 Difference]: With dead ends: 77 [2025-02-05 14:32:18,830 INFO L226 Difference]: Without dead ends: 58 [2025-02-05 14:32:18,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:32:18,830 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:18,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-05 14:32:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-05 14:32:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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:32:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-02-05 14:32:18,843 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 16 [2025-02-05 14:32:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-02-05 14:32:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:32:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-02-05 14:32:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:32:18,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:18,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:18,851 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:32:19,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:19,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1727630766, now seen corresponding path program 1 times [2025-02-05 14:32:19,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:19,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214033846] [2025-02-05 14:32:19,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:19,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:32:19,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:19,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:19,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:19,275 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:32:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214033846] [2025-02-05 14:32:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214033846] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690596570] [2025-02-05 14:32:19,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:19,277 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:32:19,281 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:32:19,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:32:19,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:19,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 14:32:19,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:19,343 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:32:19,420 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 23 treesize of output 3 [2025-02-05 14:32:19,456 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 15 treesize of output 7 [2025-02-05 14:32:19,459 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:32:19,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:19,556 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:32:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690596570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:19,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:19,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-02-05 14:32:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816749179] [2025-02-05 14:32:19,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:19,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 14:32:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:19,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 14:32:19,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-02-05 14:32:19,558 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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:32:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:19,788 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2025-02-05 14:32:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:32:19,789 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:32:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:19,789 INFO L225 Difference]: With dead ends: 134 [2025-02-05 14:32:19,790 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 14:32:19,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2025-02-05 14:32:19,790 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:19,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 97 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 14:32:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2025-02-05 14:32:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 106 states have internal predecessors, (148), 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:32:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2025-02-05 14:32:19,804 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 18 [2025-02-05 14:32:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:19,804 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2025-02-05 14:32:19,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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:32:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2025-02-05 14:32:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:32:19,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:19,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:19,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:20,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:20,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:20,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -824527156, now seen corresponding path program 1 times [2025-02-05 14:32:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134748552] [2025-02-05 14:32:20,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:20,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:32:20,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:20,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:20,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:32:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134748552] [2025-02-05 14:32:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134748552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:32:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871015037] [2025-02-05 14:32:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:32:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:20,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:32:20,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:20,123 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:32:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:20,176 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2025-02-05 14:32:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:32:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:20,178 INFO L225 Difference]: With dead ends: 141 [2025-02-05 14:32:20,178 INFO L226 Difference]: Without dead ends: 107 [2025-02-05 14:32:20,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:32:20,179 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:20,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-05 14:32:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-05 14:32:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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:32:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2025-02-05 14:32:20,190 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 18 [2025-02-05 14:32:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:20,190 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2025-02-05 14:32:20,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:32:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2025-02-05 14:32:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:32:20,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:20,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:20,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:32:20,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:20,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 743567881, now seen corresponding path program 2 times [2025-02-05 14:32:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197235469] [2025-02-05 14:32:20,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:20,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-05 14:32:20,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:20,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197235469] [2025-02-05 14:32:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197235469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128091995] [2025-02-05 14:32:20,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:20,544 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:32:20,545 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:32:20,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-05 14:32:20,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:20,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:20,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:20,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 14:32:20,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:20,630 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:32:20,642 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 15 treesize of output 1 [2025-02-05 14:32:20,696 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:32:20,696 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:32:20,705 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 39 treesize of output 22 [2025-02-05 14:32:20,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:20,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-02-05 14:32:20,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:20,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-05 14:32:20,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:20,759 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 1 case distinctions, treesize of input 16 treesize of output 14 [2025-02-05 14:32:20,801 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 15 treesize of output 7 [2025-02-05 14:32:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:20,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:20,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tail~0#1.base_12| Int) (v_ArrVal_292 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_33| Int) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (or (< 9 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_292) |v_ULTIMATE.start_main_~tail~0#1.base_12| v_ArrVal_296) |v_ULTIMATE.start_main_~p~0#1.base_33| v_ArrVal_295) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= v_ArrVal_292 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_292 .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tail~0#1.base_12|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tail~0#1.base_12| 1) |v_ULTIMATE.start_main_~p~0#1.base_33|) 0)))) is different from false [2025-02-05 14:32:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-05 14:32:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128091995] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:20,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-05 14:32:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925608398] [2025-02-05 14:32:20,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:20,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:32:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:20,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:32:20,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2025-02-05 14:32:20,931 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:21,061 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2025-02-05 14:32:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:32:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:32:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:21,062 INFO L225 Difference]: With dead ends: 133 [2025-02-05 14:32:21,062 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 14:32:21,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=166, Unknown=1, NotChecked=28, Total=272 [2025-02-05 14:32:21,063 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:21,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 78 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2025-02-05 14:32:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 14:32:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2025-02-05 14:32:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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:32:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2025-02-05 14:32:21,070 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 18 [2025-02-05 14:32:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2025-02-05 14:32:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2025-02-05 14:32:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:32:21,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:21,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:21,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:21,271 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,SelfDestructingSolverStorable6 [2025-02-05 14:32:21,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 743568842, now seen corresponding path program 1 times [2025-02-05 14:32:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280359245] [2025-02-05 14:32:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:32:21,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:21,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:21,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280359245] [2025-02-05 14:32:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280359245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059619345] [2025-02-05 14:32:21,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:21,460 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:32:21,462 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:32:21,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:32:21,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:32:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:21,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 14:32:21,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:21,536 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:32:21,539 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:32:21,580 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 30 treesize of output 25 [2025-02-05 14:32:21,587 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 39 treesize of output 22 [2025-02-05 14:32:21,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:21,590 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-02-05 14:32:21,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:21,596 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:32:21,637 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2025-02-05 14:32:21,637 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 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-05 14:32:21,640 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 12 treesize of output 1 [2025-02-05 14:32:21,652 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 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-05 14:32:21,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:21,655 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 16 treesize of output 11 [2025-02-05 14:32:21,688 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 15 treesize of output 7 [2025-02-05 14:32:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:21,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:21,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:21,732 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 16 treesize of output 20 [2025-02-05 14:32:21,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (v_ArrVal_399 (Array Int Int))) (or (< 20 (select v_arrayElimArr_2 0)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_399) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 21))) is different from false [2025-02-05 14:32:21,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_41| Int) (|v_ULTIMATE.start_main_~tail~0#1.base_16| Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (or (< 20 (select v_arrayElimArr_2 0)) (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_396) |v_ULTIMATE.start_main_~tail~0#1.base_16| v_ArrVal_399) |v_ULTIMATE.start_main_~p~0#1.base_41| v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 21) (not (= v_ArrVal_396 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_396 .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tail~0#1.base_16|) 0)))) is different from false [2025-02-05 14:32:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-02-05 14:32:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059619345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:21,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:21,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-05 14:32:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936981879] [2025-02-05 14:32:21,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:21,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 14:32:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:21,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 14:32:21,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2025-02-05 14:32:21,803 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 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:32:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:21,995 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2025-02-05 14:32:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 14:32:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:32:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:21,996 INFO L225 Difference]: With dead ends: 161 [2025-02-05 14:32:21,996 INFO L226 Difference]: Without dead ends: 142 [2025-02-05 14:32:21,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=271, Unknown=2, NotChecked=74, Total=462 [2025-02-05 14:32:21,997 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:21,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 135 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 130 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2025-02-05 14:32:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-05 14:32:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2025-02-05 14:32:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 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:32:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2025-02-05 14:32:22,011 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 18 [2025-02-05 14:32:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2025-02-05 14:32:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 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:32:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2025-02-05 14:32:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 14:32:22,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:22,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:22,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:22,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:22,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 878053287, now seen corresponding path program 1 times [2025-02-05 14:32:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532076312] [2025-02-05 14:32:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:32:22,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:32:22,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:22,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532076312] [2025-02-05 14:32:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532076312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966820749] [2025-02-05 14:32:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:22,431 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:32:22,432 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:32:22,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:32:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:32:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:22,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 14:32:22,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:22,525 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:32:22,568 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:22,572 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:22,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:32:22,583 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 80 treesize of output 69 [2025-02-05 14:32:22,592 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:32:22,592 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 15 treesize of output 15 [2025-02-05 14:32:22,598 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:32:22,602 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 27 treesize of output 1 [2025-02-05 14:32:22,684 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 35 treesize of output 19 [2025-02-05 14:32:22,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:32:22,693 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:32:22,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 14:32:22,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:32:22,727 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 15 treesize of output 7 [2025-02-05 14:32:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:22,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:22,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_481) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2025-02-05 14:32:22,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_481) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2025-02-05 14:32:22,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,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 56 treesize of output 57 [2025-02-05 14:32:22,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,795 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 154 treesize of output 105 [2025-02-05 14:32:22,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,801 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 88 treesize of output 80 [2025-02-05 14:32:22,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,807 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 72 treesize of output 62 [2025-02-05 14:32:22,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,828 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 109 treesize of output 131 [2025-02-05 14:32:22,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,844 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 186 treesize of output 167 [2025-02-05 14:32:22,855 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 95 treesize of output 83 [2025-02-05 14:32:22,861 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 71 treesize of output 55 [2025-02-05 14:32:22,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:22,874 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 46 treesize of output 50 [2025-02-05 14:32:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-05 14:32:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966820749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:23,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2025-02-05 14:32:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659979398] [2025-02-05 14:32:23,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 14:32:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:23,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 14:32:23,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=127, Unknown=2, NotChecked=46, Total=210 [2025-02-05 14:32:23,070 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:23,280 INFO L93 Difference]: Finished difference Result 195 states and 272 transitions. [2025-02-05 14:32:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:32:23,281 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 14:32:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:23,282 INFO L225 Difference]: With dead ends: 195 [2025-02-05 14:32:23,282 INFO L226 Difference]: Without dead ends: 193 [2025-02-05 14:32:23,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=216, Unknown=2, NotChecked=62, Total=342 [2025-02-05 14:32:23,283 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 127 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 175 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2025-02-05 14:32:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-05 14:32:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2025-02-05 14:32:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 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:32:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 244 transitions. [2025-02-05 14:32:23,301 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 244 transitions. Word has length 20 [2025-02-05 14:32:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:23,302 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 244 transitions. [2025-02-05 14:32:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 244 transitions. [2025-02-05 14:32:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 14:32:23,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:23,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:23,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:23,503 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,SelfDestructingSolverStorable8 [2025-02-05 14:32:23,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 878054248, now seen corresponding path program 1 times [2025-02-05 14:32:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-02-05 14:32:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:23,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:32:23,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:32:23,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:23,821 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:32:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-02-05 14:32:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288968704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553064276] [2025-02-05 14:32:23,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:23,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:23,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:23,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:32:23,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:32:23,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:32:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:23,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 14:32:23,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:23,906 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:32:23,930 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:23,934 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:23,943 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:32:23,943 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 80 treesize of output 69 [2025-02-05 14:32:23,954 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-05 14:32:23,954 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 24 treesize of output 19 [2025-02-05 14:32:23,962 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 27 treesize of output 1 [2025-02-05 14:32:23,968 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:32:23,969 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 15 treesize of output 15 [2025-02-05 14:32:24,042 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:32:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:32:24,049 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 35 treesize of output 19 [2025-02-05 14:32:24,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 14:32:24,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:32:24,076 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 15 treesize of output 7 [2025-02-05 14:32:24,078 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:32:24,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:24,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_565) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) 21)) is different from false [2025-02-05 14:32:24,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,144 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 56 treesize of output 57 [2025-02-05 14:32:24,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,152 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 154 treesize of output 105 [2025-02-05 14:32:24,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,161 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 88 treesize of output 80 [2025-02-05 14:32:24,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,169 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 72 treesize of output 62 [2025-02-05 14:32:24,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,188 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 109 treesize of output 131 [2025-02-05 14:32:24,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,201 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 186 treesize of output 167 [2025-02-05 14:32:24,211 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 95 treesize of output 83 [2025-02-05 14:32:24,217 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 71 treesize of output 55 [2025-02-05 14:32:24,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:24,227 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 46 treesize of output 50 [2025-02-05 14:32:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-05 14:32:24,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553064276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:24,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2025-02-05 14:32:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964858900] [2025-02-05 14:32:24,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 14:32:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:24,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 14:32:24,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=139, Unknown=9, NotChecked=24, Total=210 [2025-02-05 14:32:24,495 INFO L87 Difference]: Start difference. First operand 172 states and 244 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:32:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:24,705 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2025-02-05 14:32:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:32:24,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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 20 [2025-02-05 14:32:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:24,707 INFO L225 Difference]: With dead ends: 262 [2025-02-05 14:32:24,707 INFO L226 Difference]: Without dead ends: 211 [2025-02-05 14:32:24,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=233, Unknown=10, NotChecked=32, Total=342 [2025-02-05 14:32:24,707 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 94 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:24,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 199 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2025-02-05 14:32:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-05 14:32:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2025-02-05 14:32:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.418848167539267) internal successors, (271), 191 states have internal predecessors, (271), 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:32:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 271 transitions. [2025-02-05 14:32:24,723 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 271 transitions. Word has length 20 [2025-02-05 14:32:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:24,723 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 271 transitions. [2025-02-05 14:32:24,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:32:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 271 transitions. [2025-02-05 14:32:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 14:32:24,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:24,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:24,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 14:32:24,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:24,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash -524092665, now seen corresponding path program 1 times [2025-02-05 14:32:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171546118] [2025-02-05 14:32:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:32:24,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:32:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:32:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171546118] [2025-02-05 14:32:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171546118] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718551382] [2025-02-05 14:32:25,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:25,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:25,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:32:25,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:32:25,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:32:25,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:25,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 14:32:25,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:25,212 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 74 treesize of output 58 [2025-02-05 14:32:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-02-05 14:32:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 14:32:25,259 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 15 treesize of output 7 [2025-02-05 14:32:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:32:25,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:25,430 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-05 14:32:25,430 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 132 treesize of output 104 [2025-02-05 14:32:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:32:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718551382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:25,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-02-05 14:32:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929127646] [2025-02-05 14:32:25,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 14:32:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:25,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 14:32:25,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:32:25,451 INFO L87 Difference]: Start difference. First operand 192 states and 271 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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:32:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:25,617 INFO L93 Difference]: Finished difference Result 243 states and 344 transitions. [2025-02-05 14:32:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:32:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 14:32:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:25,618 INFO L225 Difference]: With dead ends: 243 [2025-02-05 14:32:25,619 INFO L226 Difference]: Without dead ends: 241 [2025-02-05 14:32:25,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-05 14:32:25,619 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:25,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 145 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-05 14:32:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2025-02-05 14:32:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.446808510638298) internal successors, (272), 188 states have internal predecessors, (272), 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:32:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2025-02-05 14:32:25,630 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 22 [2025-02-05 14:32:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2025-02-05 14:32:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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:32:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2025-02-05 14:32:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:32:25,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:25,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:25,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 14:32:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:25,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:25,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1832790306, now seen corresponding path program 2 times [2025-02-05 14:32:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053500547] [2025-02-05 14:32:25,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:25,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:32:25,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:25,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:25,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:26,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053500547] [2025-02-05 14:32:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053500547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:26,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416548105] [2025-02-05 14:32:26,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:26,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:26,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 14:32:26,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:32:26,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:26,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 14:32:26,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:26,440 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:32:26,477 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:26,486 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:32:26,486 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 16 treesize of output 15 [2025-02-05 14:32:26,492 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:26,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:32:26,501 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 16 treesize of output 15 [2025-02-05 14:32:26,505 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:32:26,512 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 15 treesize of output 1 [2025-02-05 14:32:26,525 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:32:26,526 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:32:26,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:26,616 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-05 14:32:26,616 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 78 [2025-02-05 14:32:26,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:26,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-02-05 14:32:26,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-02-05 14:32:26,633 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 20 treesize of output 15 [2025-02-05 14:32:26,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:26,639 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 1 case distinctions, treesize of input 20 treesize of output 14 [2025-02-05 14:32:26,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:32:26,722 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 35 treesize of output 19 [2025-02-05 14:32:26,730 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:32:26,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 14:32:26,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:32:26,759 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 15 treesize of output 7 [2025-02-05 14:32:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:26,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:26,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_767) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2025-02-05 14:32:26,912 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:26,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:26,918 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 70 treesize of output 76 [2025-02-05 14:32:26,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:26,927 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 57 treesize of output 58 [2025-02-05 14:32:26,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:26,936 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 264 treesize of output 215 [2025-02-05 14:32:26,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:26,946 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 182 treesize of output 152 [2025-02-05 14:32:26,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:26,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 521 treesize of output 558 [2025-02-05 14:32:27,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:27,013 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 2418 treesize of output 2243 [2025-02-05 14:32:27,047 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 424 treesize of output 364 [2025-02-05 14:32:27,062 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 472 treesize of output 424 [2025-02-05 14:32:27,073 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 229 treesize of output 193 [2025-02-05 14:32:27,084 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 285 treesize of output 261 [2025-02-05 14:32:27,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:27,108 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 222 treesize of output 238 [2025-02-05 14:32:27,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:27,133 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 214 treesize of output 222 [2025-02-05 14:32:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-05 14:32:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416548105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:28,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:28,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2025-02-05 14:32:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040751092] [2025-02-05 14:32:28,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:28,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 14:32:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:28,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 14:32:28,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=285, Unknown=6, NotChecked=34, Total=380 [2025-02-05 14:32:28,948 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 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:32:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:29,622 INFO L93 Difference]: Finished difference Result 290 states and 409 transitions. [2025-02-05 14:32:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 14:32:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 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 24 [2025-02-05 14:32:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:29,625 INFO L225 Difference]: With dead ends: 290 [2025-02-05 14:32:29,625 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 14:32:29,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=865, Unknown=10, NotChecked=62, Total=1122 [2025-02-05 14:32:29,626 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 198 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:29,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 299 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 332 Invalid, 2 Unknown, 139 Unchecked, 0.3s Time] [2025-02-05 14:32:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 14:32:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 207. [2025-02-05 14:32:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4514563106796117) internal successors, (299), 206 states have internal predecessors, (299), 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:32:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2025-02-05 14:32:29,639 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 24 [2025-02-05 14:32:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:29,639 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2025-02-05 14:32:29,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 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:32:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2025-02-05 14:32:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:32:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:29,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:29,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 14:32:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:29,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1832791267, now seen corresponding path program 2 times [2025-02-05 14:32:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800579098] [2025-02-05 14:32:29,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:29,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:32:29,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:29,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800579098] [2025-02-05 14:32:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800579098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547964562] [2025-02-05 14:32:30,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:32:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:30,258 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:30,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 14:32:30,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:32:30,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:30,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:32:30,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:30,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 14:32:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:30,363 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:32:30,401 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:30,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:32:30,414 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 16 treesize of output 15 [2025-02-05 14:32:30,418 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:32:30,426 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:32:30,435 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:32:30,435 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 50 treesize of output 43 [2025-02-05 14:32:30,442 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 19 treesize of output 1 [2025-02-05 14:32:30,448 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 15 treesize of output 11 [2025-02-05 14:32:30,466 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:32:30,466 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:32:30,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:30,572 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-05 14:32:30,572 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 82 [2025-02-05 14:32:30,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:30,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-02-05 14:32:30,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:30,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-05 14:32:30,600 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 24 treesize of output 19 [2025-02-05 14:32:30,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:30,614 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 1 case distinctions, treesize of input 20 treesize of output 14 [2025-02-05 14:32:30,703 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 39 treesize of output 23 [2025-02-05 14:32:30,707 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 19 [2025-02-05 14:32:30,710 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 31 treesize of output 19 [2025-02-05 14:32:30,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-05 14:32:30,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:32:30,741 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 15 treesize of output 7 [2025-02-05 14:32:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:30,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:30,907 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:30,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:30,913 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 70 treesize of output 76 [2025-02-05 14:32:30,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:30,922 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 57 treesize of output 58 [2025-02-05 14:32:30,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:30,931 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 264 treesize of output 215 [2025-02-05 14:32:30,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:30,939 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 182 treesize of output 152 [2025-02-05 14:32:30,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:30,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 965 treesize of output 954 [2025-02-05 14:32:31,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:31,010 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 2552 treesize of output 2239 [2025-02-05 14:32:31,049 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 424 treesize of output 364 [2025-02-05 14:32:31,066 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 472 treesize of output 424 [2025-02-05 14:32:31,081 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 313 treesize of output 289 [2025-02-05 14:32:31,092 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 213 treesize of output 177 [2025-02-05 14:32:31,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:31,114 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 222 treesize of output 238 [2025-02-05 14:32:31,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:31,139 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 214 treesize of output 222 [2025-02-05 14:32:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547964562] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:34,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-02-05 14:32:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670834689] [2025-02-05 14:32:34,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 14:32:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 14:32:34,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=241, Unknown=14, NotChecked=0, Total=306 [2025-02-05 14:32:34,954 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:35,502 INFO L93 Difference]: Finished difference Result 337 states and 487 transitions. [2025-02-05 14:32:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 14:32:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 14:32:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:35,504 INFO L225 Difference]: With dead ends: 337 [2025-02-05 14:32:35,504 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 14:32:35,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=628, Unknown=16, NotChecked=0, Total=812 [2025-02-05 14:32:35,505 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 170 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:35,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 252 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:32:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 14:32:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2025-02-05 14:32:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 196 states have internal predecessors, (284), 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:32:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 284 transitions. [2025-02-05 14:32:35,515 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 284 transitions. Word has length 24 [2025-02-05 14:32:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 284 transitions. [2025-02-05 14:32:35,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 284 transitions. [2025-02-05 14:32:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:32:35,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:35,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:35,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:35,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 14:32:35,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -348712896, now seen corresponding path program 3 times [2025-02-05 14:32:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569690049] [2025-02-05 14:32:35,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:32:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:35,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-02-05 14:32:35,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:32:35,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 14:32:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569690049] [2025-02-05 14:32:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569690049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411300258] [2025-02-05 14:32:36,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:32:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:36,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:36,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 14:32:36,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-02-05 14:32:36,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:32:36,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 14:32:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:36,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 14:32:36,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:36,134 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:32:36,179 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:32:36,180 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 15 treesize of output 15 [2025-02-05 14:32:36,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 11 [2025-02-05 14:32:36,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2025-02-05 14:32:36,265 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:32:36,266 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2025-02-05 14:32:36,269 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 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-05 14:32:36,345 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:32:36,345 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2025-02-05 14:32:36,349 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-05 14:32:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:36,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:36,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (+ (select .cse3 .cse0) 4))) (and (forall ((v_ArrVal_996 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_996) (select v_ArrVal_996 .cse0)) .cse1) 0) (not (= v_ArrVal_996 (store .cse2 |c_ULTIMATE.start_main_~p~0#1.offset| (select v_ArrVal_996 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_ArrVal_994 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~p~0#1.offset| v_ArrVal_994)) (select .cse2 .cse0)) .cse1) 0))))) is different from false [2025-02-05 14:32:36,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (+ (select .cse3 .cse0) 4))) (and (forall ((v_ArrVal_996 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_996) (select v_ArrVal_996 .cse0)) .cse1) 0) (not (= v_ArrVal_996 (store .cse2 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_996 |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((v_ArrVal_994 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_994)) (select .cse2 .cse0)) .cse1) 0))))) is different from false [2025-02-05 14:32:36,649 INFO L349 Elim1Store]: treesize reduction 131, result has 40.2 percent of original size [2025-02-05 14:32:36,649 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 1204 treesize of output 1224 [2025-02-05 14:32:37,617 INFO L349 Elim1Store]: treesize reduction 369, result has 59.5 percent of original size [2025-02-05 14:32:37,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 16 new quantified variables, introduced 77 case distinctions, treesize of input 92566 treesize of output 80354 [2025-02-05 14:32:39,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:39,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5043 treesize of output 5019