./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr4.c --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/array-tiling/mbpr4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:06:24,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:06:24,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:06:24,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:06:24,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:06:24,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:06:24,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:06:24,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:06:24,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:06:24,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:06:24,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:06:24,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:06:24,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:06:24,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:06:24,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:06:24,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:06:24,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:06:24,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:06:24,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:06:24,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:06:24,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:06:24,880 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2025-02-05 10:06:25,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:06:25,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:06:25,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:06:25,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:06:25,099 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:06:25,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr4.c [2025-02-05 10:06:26,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d81e6cb8/b752c0b574d740ab9e7019e0cd3c0f9f/FLAGd148f7a7e [2025-02-05 10:06:26,486 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:06:26,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2025-02-05 10:06:26,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d81e6cb8/b752c0b574d740ab9e7019e0cd3c0f9f/FLAGd148f7a7e [2025-02-05 10:06:26,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d81e6cb8/b752c0b574d740ab9e7019e0cd3c0f9f [2025-02-05 10:06:26,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:06:26,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:06:26,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:06:26,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:06:26,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:06:26,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439eef8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26, skipping insertion in model container [2025-02-05 10:06:26,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:06:26,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2025-02-05 10:06:26,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:06:26,680 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:06:26,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2025-02-05 10:06:26,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:06:26,719 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:06:26,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26 WrapperNode [2025-02-05 10:06:26,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:06:26,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:06:26,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:06:26,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:06:26,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,747 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2025-02-05 10:06:26,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:06:26,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:06:26,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:06:26,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:06:26,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,773 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 8, 34]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 20 writes are split as follows [0, 0, 20]. [2025-02-05 10:06:26,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:06:26,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:06:26,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:06:26,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:06:26,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (1/1) ... [2025-02-05 10:06:26,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:06:26,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:26,816 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 10:06:26,820 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 10:06:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:06:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:06:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:06:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:06:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:06:26,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:06:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:06:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:06:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:06:26,900 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:06:26,901 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:06:27,044 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 10:06:27,044 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:06:27,052 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:06:27,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:06:27,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:06:27 BoogieIcfgContainer [2025-02-05 10:06:27,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:06:27,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:06:27,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:06:27,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:06:27,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:06:26" (1/3) ... [2025-02-05 10:06:27,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a029c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:06:27, skipping insertion in model container [2025-02-05 10:06:27,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:26" (2/3) ... [2025-02-05 10:06:27,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a029c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:06:27, skipping insertion in model container [2025-02-05 10:06:27,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:06:27" (3/3) ... [2025-02-05 10:06:27,058 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2025-02-05 10:06:27,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:06:27,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr4.c that has 1 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-05 10:06:27,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:06:27,122 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;@680fbbef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:06:27,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:06:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 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 10:06:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 10:06:27,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:27,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:27,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1239568918, now seen corresponding path program 1 times [2025-02-05 10:06:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310639252] [2025-02-05 10:06:27,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:27,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 10:06:27,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 10:06:27,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:27,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:27,279 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 10:06:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:27,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310639252] [2025-02-05 10:06:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310639252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:06:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:06:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:06:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108288582] [2025-02-05 10:06:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:06:27,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:06:27,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:27,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:06:27,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:06:27,301 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:27,312 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2025-02-05 10:06:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:06:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 10:06:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:27,317 INFO L225 Difference]: With dead ends: 53 [2025-02-05 10:06:27,317 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:06:27,319 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 10:06:27,320 INFO L435 NwaCegarLoop]: 40 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, 40 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 10:06:27,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:06:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:06:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-05 10:06:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-05 10:06:27,343 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 15 [2025-02-05 10:06:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-05 10:06:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-05 10:06:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 10:06:27,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:27,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:06:27,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -557382441, now seen corresponding path program 1 times [2025-02-05 10:06:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425498842] [2025-02-05 10:06:27,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:27,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 10:06:27,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 10:06:27,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:27,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:27,662 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 10:06:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425498842] [2025-02-05 10:06:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425498842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:06:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:06:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:06:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203550395] [2025-02-05 10:06:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:06:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:06:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:27,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:06:27,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:06:27,668 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:27,753 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-02-05 10:06:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:06:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 10:06:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:27,754 INFO L225 Difference]: With dead ends: 53 [2025-02-05 10:06:27,754 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 10:06:27,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:06:27,755 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:27,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:06:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 10:06:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2025-02-05 10:06:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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 10:06:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-02-05 10:06:27,759 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 15 [2025-02-05 10:06:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:27,759 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-02-05 10:06:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-02-05 10:06:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:06:27,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:27,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:06:27,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1936116488, now seen corresponding path program 1 times [2025-02-05 10:06:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862634758] [2025-02-05 10:06:27,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:27,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:06:27,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:06:27,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:06:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862634758] [2025-02-05 10:06:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862634758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:06:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045786423] [2025-02-05 10:06:29,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:29,011 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 10:06:29,015 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 10:06:29,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:06:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:06:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:29,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 10:06:29,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:06:29,227 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 10:06:29,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-05 10:06:29,339 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 10:06:29,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:29,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2025-02-05 10:06:29,401 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 10:06:29,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:29,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2025-02-05 10:06:29,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:06:29,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:29,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-05 10:06:29,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:29,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:06:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:06:29,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:06:29,823 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 17 treesize of output 15 [2025-02-05 10:06:29,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-05 10:06:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:06:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045786423] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:06:29,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:06:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-02-05 10:06:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500647932] [2025-02-05 10:06:29,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:06:29,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:06:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:06:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:06:29,865 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 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 10:06:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:30,264 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2025-02-05 10:06:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:06:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:06:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:30,265 INFO L225 Difference]: With dead ends: 103 [2025-02-05 10:06:30,266 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 10:06:30,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 10:06:30,268 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 288 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:30,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 92 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:06:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 10:06:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 31. [2025-02-05 10:06:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-02-05 10:06:30,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 27 [2025-02-05 10:06:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:30,274 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-02-05 10:06:30,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 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 10:06:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-02-05 10:06:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:06:30,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:30,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:30,283 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 10:06:30,479 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 10:06:30,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1936086697, now seen corresponding path program 1 times [2025-02-05 10:06:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296633217] [2025-02-05 10:06:30,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:30,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:06:30,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:06:30,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:30,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:06:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296633217] [2025-02-05 10:06:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296633217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:06:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:06:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:06:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214307698] [2025-02-05 10:06:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:06:30,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:06:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:30,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:06:30,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:06:30,571 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 10:06:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:30,587 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-05 10:06:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:06:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 27 [2025-02-05 10:06:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:30,588 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:06:30,588 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 10:06:30,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:06:30,589 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:30,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:06:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 10:06:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 10:06:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-05 10:06:30,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 27 [2025-02-05 10:06:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:30,596 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-05 10:06:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 10:06:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-02-05 10:06:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 10:06:30,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:30,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:30,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:06:30,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:30,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1800935562, now seen corresponding path program 1 times [2025-02-05 10:06:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313183084] [2025-02-05 10:06:30,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:30,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 10:06:30,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 10:06:30,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:30,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:06:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313183084] [2025-02-05 10:06:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313183084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:06:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558014017] [2025-02-05 10:06:31,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:31,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:31,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:31,205 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 10:06:31,206 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 10:06:31,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 10:06:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 10:06:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:31,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:31,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 10:06:31,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:06:31,334 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 10:06:31,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:31,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-05 10:06:31,427 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 10:06:31,442 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 11 [2025-02-05 10:06:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:06:31,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:31,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-05 10:06:31,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:06:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:06:31,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:06:31,862 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 19 treesize of output 17 [2025-02-05 10:06:31,863 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 24 treesize of output 20 [2025-02-05 10:06:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:06:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558014017] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:06:31,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:06:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2025-02-05 10:06:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23784460] [2025-02-05 10:06:31,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:06:31,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:06:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:31,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:06:31,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:06:31,913 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:32,302 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2025-02-05 10:06:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 10:06:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-05 10:06:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:32,303 INFO L225 Difference]: With dead ends: 98 [2025-02-05 10:06:32,304 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 10:06:32,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 10:06:32,305 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 185 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:32,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 98 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:06:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 10:06:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2025-02-05 10:06:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-02-05 10:06:32,314 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 32 [2025-02-05 10:06:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:32,314 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-05 10:06:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-02-05 10:06:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:06:32,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:32,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:32,325 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 10:06:32,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:32,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:32,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -84208712, now seen corresponding path program 2 times [2025-02-05 10:06:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:32,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871579998] [2025-02-05 10:06:32,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:06:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:32,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-05 10:06:32,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:06:32,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:06:32,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:06:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:32,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871579998] [2025-02-05 10:06:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871579998] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:06:32,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976580944] [2025-02-05 10:06:32,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:06:32,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:32,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:32,995 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 10:06:33,001 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 10:06:33,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-05 10:06:33,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:06:33,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:06:33,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:33,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:06:33,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:06:33,158 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 10:06:33,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-05 10:06:33,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:06:33,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:33,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 35 [2025-02-05 10:06:33,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:33,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:06:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:06:33,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:06:33,488 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 19 treesize of output 17 [2025-02-05 10:06:33,489 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 24 treesize of output 20 [2025-02-05 10:06:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:06:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976580944] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:06:33,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:06:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2025-02-05 10:06:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880978172] [2025-02-05 10:06:33,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:06:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 10:06:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 10:06:33,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:06:33,533 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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 10:06:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:34,115 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2025-02-05 10:06:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 10:06:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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 37 [2025-02-05 10:06:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:34,115 INFO L225 Difference]: With dead ends: 117 [2025-02-05 10:06:34,115 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 10:06:34,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 10:06:34,116 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 200 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:34,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 132 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:06:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 10:06:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 43. [2025-02-05 10:06:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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 10:06:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-05 10:06:34,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2025-02-05 10:06:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:34,129 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-05 10:06:34,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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 10:06:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-05 10:06:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 10:06:34,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:34,129 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:34,137 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 10:06:34,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:34,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 375603382, now seen corresponding path program 3 times [2025-02-05 10:06:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:34,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954037158] [2025-02-05 10:06:34,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:06:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:34,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-02-05 10:06:34,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:06:34,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:06:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:06:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954037158] [2025-02-05 10:06:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954037158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:06:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513848749] [2025-02-05 10:06:34,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:06:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:34,891 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 10:06:34,898 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 10:06:34,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-02-05 10:06:34,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:06:34,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:06:34,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:34,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 10:06:34,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:06:35,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 10:06:35,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:35,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2025-02-05 10:06:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:06:35,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:06:35,318 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 17 treesize of output 15 [2025-02-05 10:06:35,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:06:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:06:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513848749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:06:35,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:06:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 32 [2025-02-05 10:06:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530669010] [2025-02-05 10:06:35,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:06:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:06:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:35,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:06:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:06:35,324 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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 10:06:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:36,526 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-02-05 10:06:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 10:06:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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 42 [2025-02-05 10:06:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:36,530 INFO L225 Difference]: With dead ends: 195 [2025-02-05 10:06:36,530 INFO L226 Difference]: Without dead ends: 146 [2025-02-05 10:06:36,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=791, Invalid=4611, Unknown=0, NotChecked=0, Total=5402 [2025-02-05 10:06:36,532 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 320 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:36,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 165 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:06:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-05 10:06:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2025-02-05 10:06:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 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 10:06:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2025-02-05 10:06:36,544 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 42 [2025-02-05 10:06:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:36,544 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2025-02-05 10:06:36,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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 10:06:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2025-02-05 10:06:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 10:06:36,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:36,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:36,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:06:36,750 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 10:06:36,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -869161099, now seen corresponding path program 1 times [2025-02-05 10:06:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:36,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553681186] [2025-02-05 10:06:36,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:06:36,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 10:06:36,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 10:06:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:06:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:06:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553681186] [2025-02-05 10:06:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553681186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:06:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:06:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:06:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664082643] [2025-02-05 10:06:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:06:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:06:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:06:36,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:06:36,795 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:06:36,806 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-02-05 10:06:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:06:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 10:06:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:06:36,807 INFO L225 Difference]: With dead ends: 121 [2025-02-05 10:06:36,807 INFO L226 Difference]: Without dead ends: 64 [2025-02-05 10:06:36,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:06:36,808 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:06:36,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:06:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-05 10:06:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-02-05 10:06:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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 10:06:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-02-05 10:06:36,813 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 42 [2025-02-05 10:06:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:06:36,813 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-02-05 10:06:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:06:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-02-05 10:06:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 10:06:36,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:06:36,814 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:06:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:06:36,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:06:36,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:06:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 652787382, now seen corresponding path program 4 times [2025-02-05 10:06:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:06:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476711591] [2025-02-05 10:06:36,814 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:06:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:06:36,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-05 10:06:36,845 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 10:06:36,845 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:06:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:06:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:06:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476711591] [2025-02-05 10:06:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476711591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:06:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423099577] [2025-02-05 10:06:37,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:06:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:06:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:06:37,979 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 10:06:37,984 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 10:06:38,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-05 10:06:38,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 10:06:38,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:06:38,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:06:38,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-05 10:06:38,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:06:38,159 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 10:06:38,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2025-02-05 10:06:38,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:06:38,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2025-02-05 10:06:38,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-02-05 10:06:38,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 35 [2025-02-05 10:06:38,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-02-05 10:06:38,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 38 [2025-02-05 10:06:38,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2025-02-05 10:06:38,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 45 [2025-02-05 10:06:38,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 52 [2025-02-05 10:06:38,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 66 treesize of output 62 [2025-02-05 10:06:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:06:38,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:38,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 66 [2025-02-05 10:06:38,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:06:38,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:06:38,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:06:38,909 INFO L349 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2025-02-05 10:06:38,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 42 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 48 case distinctions, treesize of input 101 treesize of output 102 [2025-02-05 10:06:39,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:06:39,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:06:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 55 treesize of output 19 [2025-02-05 10:06:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:06:39,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:06:40,160 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 19 treesize of output 17 [2025-02-05 10:06:40,161 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 24 treesize of output 20 [2025-02-05 10:06:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:06:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423099577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:06:40,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:06:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 13] total 48 [2025-02-05 10:06:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621560733] [2025-02-05 10:06:40,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:06:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 10:06:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:06:40,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 10:06:40,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2005, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 10:06:40,231 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 48 states, 48 states have (on average 3.1875) internal successors, (153), 48 states have internal predecessors, (153), 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 10:06:44,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-05 10:06:48,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:06:52,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-05 10:06:57,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:07:01,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-05 10:07:05,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:07:09,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-05 10:07:13,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-05 10:07:26,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (<= 5 (select .cse0 16)) (= (select .cse0 4) (select .cse0 20)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select .cse0 12) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ .cse1 (- 4))) 0) (<= 5 |c_ULTIMATE.start_main_~CCCELVOL4~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (= (select .cse0 .cse2) 5) (forall ((v_ArrVal_412 Int) (v_ArrVal_413 Int)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (store (let ((.cse3 (+ .cse1 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (store (store .cse0 (+ (- 16) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_412) .cse3 (select .cse0 .cse3))) (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_413) .cse2) 1))) (= (select .cse0 24) (select .cse0 8)))) is different from false [2025-02-05 10:07:31,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]