./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann02.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/recursive/Ackermann02.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 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:54:55,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:54:55,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:54:55,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:54:55,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:54:55,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:54:55,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:54:55,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:54:55,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:54:55,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:54:55,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:54:55,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:54:55,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:54:55,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:54:55,657 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:54:55,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:54:55,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:54:55,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:54:55,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:54:55,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:55,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:54:55,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:54:55,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:54:55,660 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 -> 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a [2025-02-05 15:54:55,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:54:55,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:54:55,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:54:55,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:54:55,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:54:55,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann02.c [2025-02-05 15:54:57,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69b5bd8/507b01e693a94322baba7e97a63457a2/FLAGb02dca0b1 [2025-02-05 15:54:57,369 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:54:57,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c [2025-02-05 15:54:57,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69b5bd8/507b01e693a94322baba7e97a63457a2/FLAGb02dca0b1 [2025-02-05 15:54:57,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69b5bd8/507b01e693a94322baba7e97a63457a2 [2025-02-05 15:54:57,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:54:57,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:54:57,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:57,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:54:57,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:54:57,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211ced4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57, skipping insertion in model container [2025-02-05 15:54:57,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:54:57,850 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/recursive/Ackermann02.c[1157,1170] [2025-02-05 15:54:57,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:57,861 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:54:57,872 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/recursive/Ackermann02.c[1157,1170] [2025-02-05 15:54:57,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:57,886 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:54:57,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57 WrapperNode [2025-02-05 15:54:57,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:57,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:57,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:54:57,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:54:57,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,911 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-02-05 15:54:57,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:57,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:54:57,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:54:57,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:54:57,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:54:57,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:54:57,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:54:57,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:54:57,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:54:57,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (1/1) ... [2025-02-05 15:54:57,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:57,970 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 15:54:57,972 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 15:54:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:54:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:54:57,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:54:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-02-05 15:54:57,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-02-05 15:54:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:54:58,032 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:54:58,033 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:54:58,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2025-02-05 15:54:58,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2025-02-05 15:54:58,154 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-05 15:54:58,154 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:54:58,161 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:54:58,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:54:58,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:58 BoogieIcfgContainer [2025-02-05 15:54:58,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:54:58,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:54:58,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:54:58,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:54:58,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:54:57" (1/3) ... [2025-02-05 15:54:58,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e8b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:58, skipping insertion in model container [2025-02-05 15:54:58,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:57" (2/3) ... [2025-02-05 15:54:58,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e8b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:58, skipping insertion in model container [2025-02-05 15:54:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:58" (3/3) ... [2025-02-05 15:54:58,172 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2025-02-05 15:54:58,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:54:58,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann02.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:54:58,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:54:58,248 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;@690cd604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:54:58,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:54:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:54:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 15:54:58,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:58,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:58,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:58,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -640999361, now seen corresponding path program 1 times [2025-02-05 15:54:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063037558] [2025-02-05 15:54:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:58,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 15:54:58,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 15:54:58,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:58,482 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 15:54:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063037558] [2025-02-05 15:54:58,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063037558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:58,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:58,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:54:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734504271] [2025-02-05 15:54:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:54:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:58,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:54:58,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:58,513 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:54:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:58,664 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2025-02-05 15:54:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:54:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-05 15:54:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:58,671 INFO L225 Difference]: With dead ends: 37 [2025-02-05 15:54:58,672 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 15:54:58,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:54:58,679 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:58,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 15:54:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-02-05 15:54:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 15:54:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-02-05 15:54:58,718 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 12 [2025-02-05 15:54:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:58,718 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-05 15:54:58,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:54:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-02-05 15:54:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:54:58,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:58,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:54:58,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1861650847, now seen corresponding path program 1 times [2025-02-05 15:54:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009098951] [2025-02-05 15:54:58,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:58,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:54:58,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:54:58,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:58,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:54:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009098951] [2025-02-05 15:54:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009098951] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712659288] [2025-02-05 15:54:58,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:58,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:58,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:58,849 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 15:54:58,851 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 15:54:58,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:54:58,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:54:58,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:58,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:58,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:54:58,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:54:58,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:54:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712659288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:59,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:59,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2025-02-05 15:54:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648629148] [2025-02-05 15:54:59,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:59,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:54:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:59,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:54:59,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:54:59,144 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:54:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:59,247 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2025-02-05 15:54:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:54:59,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2025-02-05 15:54:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:59,249 INFO L225 Difference]: With dead ends: 37 [2025-02-05 15:54:59,250 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 15:54:59,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:54:59,251 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:59,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 15:54:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-02-05 15:54:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-05 15:54:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2025-02-05 15:54:59,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 19 [2025-02-05 15:54:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-02-05 15:54:59,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:54:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2025-02-05 15:54:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:54:59,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:59,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:59,272 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 15:54:59,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:59,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:59,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1923489033, now seen corresponding path program 2 times [2025-02-05 15:54:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465901857] [2025-02-05 15:54:59,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:54:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:59,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 15:54:59,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:54:59,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:54:59,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:54:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465901857] [2025-02-05 15:54:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465901857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53824047] [2025-02-05 15:54:59,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:54:59,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:59,571 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 15:54:59,573 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 15:54:59,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 15:54:59,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:54:59,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:54:59,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:59,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:54:59,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:54:59,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:54:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53824047] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:59,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:54:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867081717] [2025-02-05 15:54:59,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:54:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:54:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:54:59,719 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:54:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:59,782 INFO L93 Difference]: Finished difference Result 63 states and 119 transitions. [2025-02-05 15:54:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:54:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2025-02-05 15:54:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:59,784 INFO L225 Difference]: With dead ends: 63 [2025-02-05 15:54:59,784 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 15:54:59,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:54:59,785 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:59,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 15:54:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-05 15:54:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (25), 9 states have call predecessors, (25), 6 states have call successors, (25) [2025-02-05 15:54:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2025-02-05 15:54:59,793 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 26 [2025-02-05 15:54:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:59,793 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2025-02-05 15:54:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:54:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2025-02-05 15:54:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 15:54:59,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:59,795 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:59,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:54:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:59,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1968876642, now seen corresponding path program 1 times [2025-02-05 15:54:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617736262] [2025-02-05 15:54:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:55:00,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:55:00,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:00,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:55:00,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:55:00,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:55:00,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:55:00,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:00,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:55:00,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:55:00,070 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:55:00,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:55:00,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:55:00,076 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-02-05 15:55:00,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:55:00,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:55:00 BoogieIcfgContainer [2025-02-05 15:55:00,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:55:00,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:55:00,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:55:00,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:55:00,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:58" (3/4) ... [2025-02-05 15:55:00,106 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:55:00,143 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-02-05 15:55:00,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:55:00,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:55:00,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:55:00,194 INFO L158 Benchmark]: Toolchain (without parser) took 2469.27ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 93.4MB in the end (delta: 30.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2025-02-05 15:55:00,194 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:00,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.20ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:00,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:00,195 INFO L158 Benchmark]: Boogie Preprocessor took 32.59ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.8MB in the end (delta: 638.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:00,195 INFO L158 Benchmark]: IcfgBuilder took 216.73ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 99.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:55:00,195 INFO L158 Benchmark]: TraceAbstraction took 1939.35ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 99.4MB in the end (delta: -833.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:00,196 INFO L158 Benchmark]: Witness Printer took 89.77ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 93.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:00,197 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.20ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.59ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.8MB in the end (delta: 638.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 216.73ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 99.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1939.35ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 99.4MB in the end (delta: -833.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 89.77ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 93.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 45]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int m = __VERIFIER_nondet_int(); [L29] COND FALSE !(m < 0 || m > 3) [L34] int n = __VERIFIER_nondet_int(); [L35] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L41] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L20] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L20] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L20] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2] [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, m=1] [L21] return ackermann(m-1,1); [L23] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3] [L23] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] return ackermann(m-1,ackermann(m,n-1)); [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, m=2] [L21] return ackermann(m-1,1); [L41] RET, EXPR ackermann(m,n) VAL [m=2, n=0] [L41] int result = ackermann(m,n); [L42] COND FALSE !(m < 2 || result >= 4) VAL [n=0] [L45] reach_error() VAL [n=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 68 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 47/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:55:00,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE