./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn5.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-fpi/ifeqn5.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 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:29:28,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:29:28,137 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:29:28,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:29:28,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:29:28,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:29:28,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:29:28,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:29:28,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:29:28,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:29:28,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:29:28,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:29:28,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:29:28,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:29:28,156 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:29:28,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:29:28,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:29:28,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:29:28,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:29:28,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:29:28,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:29:28,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:29:28,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:29:28,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:29:28,159 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 -> 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 [2025-02-05 10:29:28,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:29:28,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:29:28,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:29:28,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:29:28,407 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:29:28,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn5.c [2025-02-05 10:29:29,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0efb797/d0f2abbfcc0d42448a0800a2286114a5/FLAG17ecf23de [2025-02-05 10:29:29,734 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:29:29,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c [2025-02-05 10:29:29,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0efb797/d0f2abbfcc0d42448a0800a2286114a5/FLAG17ecf23de [2025-02-05 10:29:29,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0efb797/d0f2abbfcc0d42448a0800a2286114a5 [2025-02-05 10:29:29,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:29:29,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:29:29,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:29:29,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:29:29,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:29:29,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a740f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29, skipping insertion in model container [2025-02-05 10:29:29,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:29:29,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c[589,602] [2025-02-05 10:29:29,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:29:29,889 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:29:29,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c[589,602] [2025-02-05 10:29:29,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:29:29,912 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:29:29,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29 WrapperNode [2025-02-05 10:29:29,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:29:29,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:29:29,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:29:29,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:29:29,917 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:29:29" (1/1) ... [2025-02-05 10:29:29,921 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:29:29" (1/1) ... [2025-02-05 10:29:29,931 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-02-05 10:29:29,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:29:29,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:29:29,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:29:29,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:29:29,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,946 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-02-05 10:29:29,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:29:29,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:29:29,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:29:29,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:29:29,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (1/1) ... [2025-02-05 10:29:29,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:29:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:29,976 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:29:29,981 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:29:29,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:29:29,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:29:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:29:29,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:29:29,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:29:29,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:29:29,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:29:30,049 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:29:30,050 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:29:30,155 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 10:29:30,155 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:29:30,161 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:29:30,161 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:29:30,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:29:30 BoogieIcfgContainer [2025-02-05 10:29:30,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:29:30,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:29:30,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:29:30,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:29:30,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:29:29" (1/3) ... [2025-02-05 10:29:30,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f46d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:29:30, skipping insertion in model container [2025-02-05 10:29:30,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:29" (2/3) ... [2025-02-05 10:29:30,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f46d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:29:30, skipping insertion in model container [2025-02-05 10:29:30,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:29:30" (3/3) ... [2025-02-05 10:29:30,168 INFO L128 eAbstractionObserver]: Analyzing ICFG ifeqn5.c [2025-02-05 10:29:30,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:29:30,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ifeqn5.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 10:29:30,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:29:30,217 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;@789b2b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:29:30,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:29:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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:29:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:29:30,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:30,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:30,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:30,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1070233101, now seen corresponding path program 1 times [2025-02-05 10:29:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:30,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596055137] [2025-02-05 10:29:30,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:30,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:29:30,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:29:30,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:30,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:30,346 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:29:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596055137] [2025-02-05 10:29:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596055137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:29:30,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:29:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:29:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352357510] [2025-02-05 10:29:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:29:30,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:29:30,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:30,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:29:30,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:29:30,363 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:30,371 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-02-05 10:29:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:29:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 10:29:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:30,376 INFO L225 Difference]: With dead ends: 34 [2025-02-05 10:29:30,376 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 10:29:30,378 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:29:30,379 INFO L435 NwaCegarLoop]: 24 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, 24 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:29:30,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:29:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 10:29:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 10:29:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-05 10:29:30,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2025-02-05 10:29:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:30,402 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-05 10:29:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-05 10:29:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:29:30,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:30,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:30,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:29:30,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:30,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash -182729420, now seen corresponding path program 1 times [2025-02-05 10:29:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361595988] [2025-02-05 10:29:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:30,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:29:30,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:29:30,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:30,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:30,560 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:29:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361595988] [2025-02-05 10:29:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361595988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:29:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:29:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:29:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427979726] [2025-02-05 10:29:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:29:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:29:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:30,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:29:30,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:29:30,563 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:30,608 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-05 10:29:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:29:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 10:29:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:30,609 INFO L225 Difference]: With dead ends: 38 [2025-02-05 10:29:30,609 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 10:29:30,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:29:30,610 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:30,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:29:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 10:29:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-02-05 10:29:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-05 10:29:30,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2025-02-05 10:29:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:30,615 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-05 10:29:30,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-05 10:29:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:29:30,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:30,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:30,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:29:30,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1748871957, now seen corresponding path program 1 times [2025-02-05 10:29:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081825819] [2025-02-05 10:29:30,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:30,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:29:30,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:29:30,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:30,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:29:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912534062] [2025-02-05 10:29:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:30,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:30,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:30,648 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:29:30,649 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:29:30,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:29:30,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:29:30,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:30,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:29:30,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:30,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:29:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:30,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:29:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081825819] [2025-02-05 10:29:30,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:29:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912534062] [2025-02-05 10:29:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912534062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:29:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:29:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:29:30,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991307948] [2025-02-05 10:29:30,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:29:30,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:29:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:29:30,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:29:30,801 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:29:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:30,841 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-02-05 10:29:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:29:30,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:29:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:30,841 INFO L225 Difference]: With dead ends: 33 [2025-02-05 10:29:30,841 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:29:30,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:29:30,842 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:30,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:29:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:29:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-02-05 10:29:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-05 10:29:30,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2025-02-05 10:29:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:30,846 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-05 10:29:30,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:29:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-02-05 10:29:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:29:30,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:30,846 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:30,852 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:29:31,051 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:29:31,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:31,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1602924971, now seen corresponding path program 1 times [2025-02-05 10:29:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351517436] [2025-02-05 10:29:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:31,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:29:31,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:29:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:31,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351517436] [2025-02-05 10:29:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351517436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:29:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201162276] [2025-02-05 10:29:31,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:31,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:31,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:31,222 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:29:31,223 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:29:31,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:29:31,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:29:31,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:31,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:31,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:29:31,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:31,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201162276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:31,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:29:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 10:29:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591425770] [2025-02-05 10:29:31,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:31,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:29:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:31,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:29:31,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:29:31,363 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:29:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:31,446 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-02-05 10:29:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:29:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 19 [2025-02-05 10:29:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:31,447 INFO L225 Difference]: With dead ends: 58 [2025-02-05 10:29:31,448 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:29:31,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:29:31,448 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:31,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 26 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:29:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:29:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2025-02-05 10:29:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:29:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-05 10:29:31,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2025-02-05 10:29:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:31,453 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-05 10:29:31,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:29:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-05 10:29:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:29:31,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:31,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:31,460 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:29:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:31,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1149620212, now seen corresponding path program 1 times [2025-02-05 10:29:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352967667] [2025-02-05 10:29:31,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:29:31,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:29:31,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:29:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6132164] [2025-02-05 10:29:31,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:31,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:31,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:31,722 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:29:31,723 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:29:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:29:31,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:29:31,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:31,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:31,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 10:29:31,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:31,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:29:31,828 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 15 [2025-02-05 10:29:31,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-05 10:29:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:31,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:32,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:29:32,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 163 [2025-02-05 10:29:32,155 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 21 treesize of output 19 [2025-02-05 10:29:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:29:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352967667] [2025-02-05 10:29:32,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:29:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6132164] [2025-02-05 10:29:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6132164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:32,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:29:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2025-02-05 10:29:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144248091] [2025-02-05 10:29:32,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:32,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:29:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:32,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:29:32,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:29:32,176 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:29:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:32,404 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-02-05 10:29:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:29:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:29:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:32,405 INFO L225 Difference]: With dead ends: 79 [2025-02-05 10:29:32,405 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 10:29:32,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:29:32,406 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:32,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 63 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:29:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 10:29:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 35. [2025-02-05 10:29:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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:29:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-02-05 10:29:32,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 22 [2025-02-05 10:29:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-05 10:29:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:29:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-02-05 10:29:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:29:32,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:32,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:32,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:29:32,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:32,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:32,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 267389206, now seen corresponding path program 1 times [2025-02-05 10:29:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868500871] [2025-02-05 10:29:32,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:29:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:29:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:29:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638457827] [2025-02-05 10:29:32,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:32,673 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:29:32,675 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:29:32,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:29:32,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:29:32,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:32,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:32,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 10:29:32,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:32,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:29:32,846 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:29:32,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:29:32,975 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:29:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:29:33,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:33,349 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 48 treesize of output 44 [2025-02-05 10:29:33,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:29:33,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 73 [2025-02-05 10:29:33,618 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:29:33,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-02-05 10:29:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:29:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868500871] [2025-02-05 10:29:33,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:29:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638457827] [2025-02-05 10:29:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638457827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:33,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:29:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-02-05 10:29:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658516378] [2025-02-05 10:29:33,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:33,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 10:29:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:33,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 10:29:33,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:29:33,653 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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:29:36,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 10:29:40,009 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 [] [2025-02-05 10:29:44,110 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 [] [2025-02-05 10:29:48,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 10:29:54,154 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 [] [2025-02-05 10:29:58,267 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 [] [2025-02-05 10:30:02,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 10:30:06,571 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 [] [2025-02-05 10:30:10,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 10:30:16,999 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 [] [2025-02-05 10:30:25,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-02-05 10:30:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:25,253 INFO L93 Difference]: Finished difference Result 241 states and 281 transitions. [2025-02-05 10:30:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 10:30:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:30:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:25,256 INFO L225 Difference]: With dead ends: 241 [2025-02-05 10:30:25,257 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 10:30:25,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=624, Invalid=2568, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 10:30:25,258 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 528 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 115 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:25,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 144 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 397 Invalid, 8 Unknown, 0 Unchecked, 42.8s Time] [2025-02-05 10:30:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 10:30:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 88. [2025-02-05 10:30:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 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:30:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2025-02-05 10:30:25,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 25 [2025-02-05 10:30:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:25,286 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2025-02-05 10:30:25,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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:30:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2025-02-05 10:30:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:30:25,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:25,286 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:25,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:30:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 10:30:25,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1371626316, now seen corresponding path program 2 times [2025-02-05 10:30:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338780498] [2025-02-05 10:30:25,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:30:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:25,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-05 10:30:25,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:30:25,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:30:25,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:30:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338780498] [2025-02-05 10:30:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338780498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:30:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339184178] [2025-02-05 10:30:25,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:30:25,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:25,668 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:30:25,671 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:30:25,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-05 10:30:25,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:30:25,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:30:25,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:25,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:30:25,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:30:25,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:30:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339184178] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:25,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:30:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:30:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959955015] [2025-02-05 10:30:25,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:25,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:30:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:25,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:30:25,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:30:25,889 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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:30:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:26,043 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2025-02-05 10:30:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:30:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-05 10:30:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:26,045 INFO L225 Difference]: With dead ends: 171 [2025-02-05 10:30:26,045 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 10:30:26,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:30:26,045 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:26,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 54 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:30:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 10:30:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2025-02-05 10:30:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 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:30:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2025-02-05 10:30:26,058 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 28 [2025-02-05 10:30:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:26,058 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2025-02-05 10:30:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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:30:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2025-02-05 10:30:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 10:30:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:26,059 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:26,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:30:26,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:26,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:26,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 640455736, now seen corresponding path program 3 times [2025-02-05 10:30:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:26,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276568750] [2025-02-05 10:30:26,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:30:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:26,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 6 equivalence classes. [2025-02-05 10:30:26,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 34 statements. [2025-02-05 10:30:26,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:30:26,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:30:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276568750] [2025-02-05 10:30:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276568750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:30:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591556830] [2025-02-05 10:30:26,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:30:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:26,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:30:26,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:30:26,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 6 equivalence classes. [2025-02-05 10:30:26,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 34 statements. [2025-02-05 10:30:26,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:30:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:26,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:30:26,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:30:26,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:30:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591556830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:26,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:30:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-05 10:30:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069829398] [2025-02-05 10:30:26,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:26,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 10:30:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:26,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 10:30:26,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:30:26,914 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:30:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:27,381 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2025-02-05 10:30:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 10:30:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 10:30:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:27,382 INFO L225 Difference]: With dead ends: 146 [2025-02-05 10:30:27,382 INFO L226 Difference]: Without dead ends: 139 [2025-02-05 10:30:27,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 10:30:27,383 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 135 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:27,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 63 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:30:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-05 10:30:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-02-05 10:30:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 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:30:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-02-05 10:30:27,395 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 34 [2025-02-05 10:30:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:27,395 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-02-05 10:30:27,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:30:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-02-05 10:30:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 10:30:27,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:27,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:27,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:30:27,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 10:30:27,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:27,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash 243636533, now seen corresponding path program 4 times [2025-02-05 10:30:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304138643] [2025-02-05 10:30:27,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:30:27,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:27,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-05 10:30:27,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:30:27,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:30:27,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:30:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074323083] [2025-02-05 10:30:27,666 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:30:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:27,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:30:27,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:30:27,707 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-05 10:30:27,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:30:27,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:30:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:27,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 10:30:27,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:30:27,906 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:30:27,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:27,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:30:28,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:30:28,199 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:30:28,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:28,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:30:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:28,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:31,646 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 132 treesize of output 124 [2025-02-05 10:30:31,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:31,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 147 [2025-02-05 10:30:31,671 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 54 treesize of output 50 [2025-02-05 10:30:31,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:31,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 34 [2025-02-05 10:30:31,682 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 9 treesize of output 3 [2025-02-05 10:30:31,685 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 97 treesize of output 91 [2025-02-05 10:30:31,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:31,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 247 [2025-02-05 10:30:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304138643] [2025-02-05 10:30:32,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:30:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074323083] [2025-02-05 10:30:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074323083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:32,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:30:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2025-02-05 10:30:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791947016] [2025-02-05 10:30:32,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:32,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 10:30:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:32,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 10:30:32,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 10:30:32,896 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 36 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:30:54,347 WARN L286 SmtUtils]: Spent 20.74s on a formula simplification. DAG size of input: 133 DAG size of output: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 10:31:12,650 WARN L286 SmtUtils]: Spent 16.26s on a formula simplification. DAG size of input: 221 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)