./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-simple/id_i15_o15-2.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 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:05:20,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:05:20,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:05:20,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:05:20,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:05:20,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:05:20,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:05:20,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:05:20,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:05:20,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:05:20,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:05:20,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:05:20,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:05:20,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:05:20,827 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:05:20,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:05:20,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:05:20,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:05:20,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:05:20,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:05:20,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:05:20,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:05:20,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:05:20,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:05:20,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:05:20,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:05:20,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:05:20,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:05:20,830 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 -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2025-02-07 21:05:21,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:05:21,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:05:21,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:05:21,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:05:21,113 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:05:21,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-02-07 21:05:22,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbed00a7f/64d251263f9a40e0b1de72d6b1cfd2e0/FLAGdf2f65396 [2025-02-07 21:05:22,550 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:05:22,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-02-07 21:05:22,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbed00a7f/64d251263f9a40e0b1de72d6b1cfd2e0/FLAGdf2f65396 [2025-02-07 21:05:22,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbed00a7f/64d251263f9a40e0b1de72d6b1cfd2e0 [2025-02-07 21:05:22,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:05:22,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:05:22,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:05:22,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:05:22,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:05:22,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:05:22" (1/1) ... [2025-02-07 21:05:22,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443e8196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:22, skipping insertion in model container [2025-02-07 21:05:22,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:05:22" (1/1) ... [2025-02-07 21:05:22,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:05:23,054 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-simple/id_i15_o15-2.c[454,467] [2025-02-07 21:05:23,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:05:23,063 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:05:23,073 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-simple/id_i15_o15-2.c[454,467] [2025-02-07 21:05:23,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:05:23,084 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:05:23,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23 WrapperNode [2025-02-07 21:05:23,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:05:23,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:05:23,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:05:23,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:05:23,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,105 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-07 21:05:23,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:05:23,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:05:23,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:05:23,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:05:23,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,122 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-07 21:05:23,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:05:23,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:05:23,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:05:23,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:05:23,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (1/1) ... [2025-02-07 21:05:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:05:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:23,163 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-07 21:05:23,167 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-07 21:05:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:05:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:05:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:05:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:05:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-02-07 21:05:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-02-07 21:05:23,244 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:05:23,246 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:05:23,328 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-02-07 21:05:23,332 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-07 21:05:23,332 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:05:23,340 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:05:23,340 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:05:23,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:05:23 BoogieIcfgContainer [2025-02-07 21:05:23,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:05:23,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:05:23,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:05:23,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:05:23,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:05:22" (1/3) ... [2025-02-07 21:05:23,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8c15c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:05:23, skipping insertion in model container [2025-02-07 21:05:23,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:05:23" (2/3) ... [2025-02-07 21:05:23,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8c15c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:05:23, skipping insertion in model container [2025-02-07 21:05:23,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:05:23" (3/3) ... [2025-02-07 21:05:23,350 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2025-02-07 21:05:23,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:05:23,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i15_o15-2.c that has 2 procedures, 15 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:05:23,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:05:23,413 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;@3f67a0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:05:23,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:05:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 21:05:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 21:05:23,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:23,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:23,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:23,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2049432346, now seen corresponding path program 1 times [2025-02-07 21:05:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638481501] [2025-02-07 21:05:23,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:05:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:23,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 21:05:23,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 21:05:23,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:23,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:23,646 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-07 21:05:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638481501] [2025-02-07 21:05:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638481501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:05:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:05:23,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:05:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257802960] [2025-02-07 21:05:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:05:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:05:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:23,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:05:23,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:05:23,674 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:05:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:23,736 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-02-07 21:05:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:05:23,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-02-07 21:05:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:23,743 INFO L225 Difference]: With dead ends: 24 [2025-02-07 21:05:23,743 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 21:05:23,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:05:23,748 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:23,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 21:05:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 21:05:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 21:05:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-02-07 21:05:23,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2025-02-07 21:05:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:23,783 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-07 21:05:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-07 21:05:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-02-07 21:05:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 21:05:23,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:23,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:23,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:05:23,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1071660829, now seen corresponding path program 1 times [2025-02-07 21:05:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730969189] [2025-02-07 21:05:23,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:05:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:23,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 21:05:23,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 21:05:23,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:23,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:23,929 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-07 21:05:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730969189] [2025-02-07 21:05:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730969189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709754794] [2025-02-07 21:05:23,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:05:23,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:23,932 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-07 21:05:23,933 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-07 21:05:23,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 21:05:23,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 21:05:23,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:23,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:05:23,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:24,016 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-07 21:05:24,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:24,171 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-07 21:05:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709754794] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:24,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-02-07 21:05:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934975182] [2025-02-07 21:05:24,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:24,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 21:05:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:24,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 21:05:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:05:24,175 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:05:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:24,327 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-02-07 21:05:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:05:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2025-02-07 21:05:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:24,329 INFO L225 Difference]: With dead ends: 21 [2025-02-07 21:05:24,329 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 21:05:24,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:05:24,330 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:24,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 21:05:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-07 21:05:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 21:05:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-02-07 21:05:24,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2025-02-07 21:05:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:24,335 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-02-07 21:05:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:05:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-02-07 21:05:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 21:05:24,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:24,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:24,344 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-07 21:05:24,542 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-07 21:05:24,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:24,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash 694941498, now seen corresponding path program 2 times [2025-02-07 21:05:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95607674] [2025-02-07 21:05:24,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:24,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 21:05:24,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 21:05:24,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:24,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 21:05:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95607674] [2025-02-07 21:05:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95607674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567226550] [2025-02-07 21:05:24,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:24,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:24,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:24,721 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-07 21:05:24,723 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-07 21:05:24,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 21:05:24,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 21:05:24,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:24,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:05:24,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 21:05:24,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 21:05:25,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567226550] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:25,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:25,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2025-02-07 21:05:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372370660] [2025-02-07 21:05:25,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:05:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:25,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:05:25,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:05:25,085 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 21:05:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:25,165 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-02-07 21:05:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:05:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 21 [2025-02-07 21:05:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:25,167 INFO L225 Difference]: With dead ends: 24 [2025-02-07 21:05:25,167 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 21:05:25,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-07 21:05:25,167 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:25,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 21:05:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-07 21:05:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:05:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-07 21:05:25,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2025-02-07 21:05:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-07 21:05:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-07 21:05:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-07 21:05:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 21:05:25,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:25,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:25,179 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-07 21:05:25,373 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-07 21:05:25,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:25,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1868965309, now seen corresponding path program 3 times [2025-02-07 21:05:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553443934] [2025-02-07 21:05:25,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:25,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-02-07 21:05:25,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 21:05:25,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:05:25,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 21:05:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:25,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553443934] [2025-02-07 21:05:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553443934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:25,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370316661] [2025-02-07 21:05:25,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:25,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:25,561 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-07 21:05:25,563 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-07 21:05:25,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-02-07 21:05:25,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 21:05:25,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:05:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:25,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 21:05:25,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 21:05:25,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 21:05:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370316661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:26,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 17 [2025-02-07 21:05:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716532585] [2025-02-07 21:05:26,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:05:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:26,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:05:26,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:05:26,050 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-07 21:05:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:26,133 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-07 21:05:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:05:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 27 [2025-02-07 21:05:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:26,138 INFO L225 Difference]: With dead ends: 27 [2025-02-07 21:05:26,138 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 21:05:26,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:05:26,139 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:26,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 49 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 21:05:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-07 21:05:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 21:05:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-07 21:05:26,142 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2025-02-07 21:05:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-07 21:05:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-07 21:05:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-07 21:05:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:05:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:26,144 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:26,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:26,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:26,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1787489114, now seen corresponding path program 4 times [2025-02-07 21:05:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888619121] [2025-02-07 21:05:26,349 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:26,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-07 21:05:26,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:05:26,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:05:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 21:05:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888619121] [2025-02-07 21:05:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888619121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235126848] [2025-02-07 21:05:26,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:26,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:26,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:26,514 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-07 21:05:26,515 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-07 21:05:26,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-07 21:05:26,552 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:05:26,552 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:05:26,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:26,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:05:26,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-07 21:05:26,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 21:05:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235126848] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:27,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 20 [2025-02-07 21:05:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128775179] [2025-02-07 21:05:27,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 21:05:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 21:05:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:05:27,209 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-07 21:05:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:27,311 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-02-07 21:05:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:05:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 33 [2025-02-07 21:05:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:27,312 INFO L225 Difference]: With dead ends: 42 [2025-02-07 21:05:27,312 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 21:05:27,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:05:27,313 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:27,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 65 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 21:05:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-02-07 21:05:27,317 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), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-07 21:05:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-02-07 21:05:27,318 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2025-02-07 21:05:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-02-07 21:05:27,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-07 21:05:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-02-07 21:05:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 21:05:27,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:27,319 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:27,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 21:05:27,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:27,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash 507757827, now seen corresponding path program 5 times [2025-02-07 21:05:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59357016] [2025-02-07 21:05:27,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:05:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:27,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 8 equivalence classes. [2025-02-07 21:05:27,537 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 21:05:27,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-07 21:05:27,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-07 21:05:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59357016] [2025-02-07 21:05:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59357016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12467497] [2025-02-07 21:05:27,787 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:05:27,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:27,789 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-07 21:05:27,794 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-07 21:05:27,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 8 equivalence classes. [2025-02-07 21:05:27,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 21:05:27,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-07 21:05:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:27,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 21:05:27,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-07 21:05:28,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 21:05:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12467497] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:29,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 19] total 38 [2025-02-07 21:05:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570480311] [2025-02-07 21:05:29,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:29,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 21:05:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:29,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 21:05:29,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 21:05:29,860 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 11 states have call successors, (12), 1 states have call predecessors, (12), 16 states have return successors, (24), 16 states have call predecessors, (24), 11 states have call successors, (24) [2025-02-07 21:05:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:30,100 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-02-07 21:05:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 21:05:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 11 states have call successors, (12), 1 states have call predecessors, (12), 16 states have return successors, (24), 16 states have call predecessors, (24), 11 states have call successors, (24) Word has length 51 [2025-02-07 21:05:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:30,101 INFO L225 Difference]: With dead ends: 48 [2025-02-07 21:05:30,101 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 21:05:30,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=529, Invalid=2227, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 21:05:30,103 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:30,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 126 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 21:05:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-02-07 21:05:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-07 21:05:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-02-07 21:05:30,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 51 [2025-02-07 21:05:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:30,108 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-02-07 21:05:30,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 11 states have call successors, (12), 1 states have call predecessors, (12), 16 states have return successors, (24), 16 states have call predecessors, (24), 11 states have call successors, (24) [2025-02-07 21:05:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-02-07 21:05:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-07 21:05:30,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:30,109 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:30,114 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-07 21:05:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:30,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -617522278, now seen corresponding path program 6 times [2025-02-07 21:05:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453905205] [2025-02-07 21:05:30,316 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:05:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:30,332 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 9 equivalence classes. [2025-02-07 21:05:30,357 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 21:05:30,358 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-07 21:05:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-07 21:05:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453905205] [2025-02-07 21:05:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453905205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138515756] [2025-02-07 21:05:30,633 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:05:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:30,635 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-07 21:05:30,636 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-07 21:05:30,714 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 9 equivalence classes. [2025-02-07 21:05:30,732 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 21:05:30,732 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-07 21:05:30,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:30,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 21:05:30,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-07 21:05:30,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 21:05:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138515756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:33,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 21] total 42 [2025-02-07 21:05:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106171347] [2025-02-07 21:05:33,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-07 21:05:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:33,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-07 21:05:33,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1486, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 21:05:33,386 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 42 states, 40 states have (on average 1.65) internal successors, (66), 33 states have internal predecessors, (66), 12 states have call successors, (13), 1 states have call predecessors, (13), 18 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-07 21:05:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:33,721 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2025-02-07 21:05:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 21:05:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.65) internal successors, (66), 33 states have internal predecessors, (66), 12 states have call successors, (13), 1 states have call predecessors, (13), 18 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) Word has length 57 [2025-02-07 21:05:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:33,729 INFO L225 Difference]: With dead ends: 51 [2025-02-07 21:05:33,729 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 21:05:33,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 84 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=2765, Unknown=0, NotChecked=0, Total=3422 [2025-02-07 21:05:33,731 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:33,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 144 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 21:05:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-02-07 21:05:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-07 21:05:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-02-07 21:05:33,741 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 57 [2025-02-07 21:05:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-02-07 21:05:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.65) internal successors, (66), 33 states have internal predecessors, (66), 12 states have call successors, (13), 1 states have call predecessors, (13), 18 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) [2025-02-07 21:05:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-02-07 21:05:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-07 21:05:33,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:33,746 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:33,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 21:05:33,946 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,SelfDestructingSolverStorable6 [2025-02-07 21:05:33,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:33,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1351063139, now seen corresponding path program 7 times [2025-02-07 21:05:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:33,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508067553] [2025-02-07 21:05:33,947 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:33,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-07 21:05:33,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 21:05:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-07 21:05:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508067553] [2025-02-07 21:05:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508067553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73527528] [2025-02-07 21:05:34,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:05:34,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:34,161 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-07 21:05:34,162 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-07 21:05:34,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-07 21:05:34,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 21:05:34,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:34,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:34,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 21:05:34,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-07 21:05:34,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 21:05:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73527528] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:37,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:37,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2025-02-07 21:05:37,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159341829] [2025-02-07 21:05:37,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:37,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 21:05:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:37,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 21:05:37,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-02-07 21:05:37,592 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-07 21:05:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:37,690 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-02-07 21:05:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:05:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) Word has length 63 [2025-02-07 21:05:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:37,691 INFO L225 Difference]: With dead ends: 54 [2025-02-07 21:05:37,691 INFO L226 Difference]: Without dead ends: 47 [2025-02-07 21:05:37,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 21:05:37,692 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:37,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-07 21:05:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-02-07 21:05:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 21:05:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-02-07 21:05:37,698 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 63 [2025-02-07 21:05:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:37,698 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-02-07 21:05:37,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-07 21:05:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-02-07 21:05:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 21:05:37,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:37,699 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:37,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:37,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:37,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:37,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1612392518, now seen corresponding path program 8 times [2025-02-07 21:05:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318228258] [2025-02-07 21:05:37,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:37,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-02-07 21:05:37,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 21:05:37,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:37,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-07 21:05:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318228258] [2025-02-07 21:05:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318228258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746109640] [2025-02-07 21:05:38,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:05:38,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:38,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:38,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 21:05:38,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-02-07 21:05:38,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 21:05:38,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:05:38,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:38,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 21:05:38,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-07 21:05:38,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-07 21:05:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746109640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:41,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 25] total 29 [2025-02-07 21:05:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100062587] [2025-02-07 21:05:41,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:41,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 21:05:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 21:05:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2025-02-07 21:05:41,693 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 29 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-07 21:05:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:41,876 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-02-07 21:05:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 21:05:41,877 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) Word has length 69 [2025-02-07 21:05:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:41,877 INFO L225 Difference]: With dead ends: 57 [2025-02-07 21:05:41,878 INFO L226 Difference]: Without dead ends: 50 [2025-02-07 21:05:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 123 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=497, Invalid=1063, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:05:41,878 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 133 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:41,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 84 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-07 21:05:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-02-07 21:05:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-07 21:05:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-02-07 21:05:41,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 69 [2025-02-07 21:05:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:41,884 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-02-07 21:05:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-07 21:05:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-02-07 21:05:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:05:41,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:41,885 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 21:05:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:42,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1119006781, now seen corresponding path program 9 times [2025-02-07 21:05:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937217024] [2025-02-07 21:05:42,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:42,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 12 equivalence classes. [2025-02-07 21:05:42,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:05:42,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-07 21:05:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 26 proven. 224 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-07 21:05:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937217024] [2025-02-07 21:05:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937217024] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693041876] [2025-02-07 21:05:42,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:05:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:42,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:42,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 21:05:42,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 12 equivalence classes. [2025-02-07 21:05:42,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:05:42,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-07 21:05:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:42,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 21:05:42,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-07 21:05:42,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-07 21:05:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693041876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:46,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 27] total 34 [2025-02-07 21:05:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226111523] [2025-02-07 21:05:46,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:46,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 21:05:46,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:46,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 21:05:46,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 21:05:46,849 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 13 states have call predecessors, (28), 16 states have call successors, (28) [2025-02-07 21:05:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:46,959 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2025-02-07 21:05:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 21:05:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 13 states have call predecessors, (28), 16 states have call successors, (28) Word has length 75 [2025-02-07 21:05:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:46,960 INFO L225 Difference]: With dead ends: 60 [2025-02-07 21:05:46,960 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 21:05:46,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=628, Invalid=1352, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 21:05:46,961 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:46,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 101 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:05:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 21:05:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-02-07 21:05:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 21:05:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-02-07 21:05:46,965 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 75 [2025-02-07 21:05:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:46,966 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-02-07 21:05:46,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 13 states have call predecessors, (28), 16 states have call successors, (28) [2025-02-07 21:05:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-02-07 21:05:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 21:05:46,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:46,967 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:46,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 21:05:47,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:47,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:47,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -523555878, now seen corresponding path program 10 times [2025-02-07 21:05:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326896546] [2025-02-07 21:05:47,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:47,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-02-07 21:05:47,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 21:05:47,178 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:05:47,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 21 proven. 245 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-07 21:05:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:05:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326896546] [2025-02-07 21:05:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326896546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:05:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682845697] [2025-02-07 21:05:47,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:05:47,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:05:47,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:05:47,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 21:05:47,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-02-07 21:05:47,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 21:05:47,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:05:47,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:05:47,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 21:05:47,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:05:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-07 21:05:47,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:05:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-07 21:05:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682845697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:05:53,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:05:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 29] total 36 [2025-02-07 21:05:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686552941] [2025-02-07 21:05:53,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:05:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 21:05:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:05:53,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 21:05:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 21:05:53,205 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-07 21:05:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:05:53,396 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-02-07 21:05:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 21:05:53,397 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 18 states have call successors, (29) Word has length 81 [2025-02-07 21:05:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:05:53,397 INFO L225 Difference]: With dead ends: 72 [2025-02-07 21:05:53,397 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 21:05:53,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=790, Invalid=1760, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 21:05:53,398 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:05:53,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 124 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:05:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 21:05:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-02-07 21:05:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-07 21:05:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-02-07 21:05:53,403 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 81 [2025-02-07 21:05:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:05:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-02-07 21:05:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 18 states have call successors, (29) [2025-02-07 21:05:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-02-07 21:05:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 21:05:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:05:53,405 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:05:53,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-07 21:05:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:05:53,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:05:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:05:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1241938563, now seen corresponding path program 11 times [2025-02-07 21:05:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:05:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513532717] [2025-02-07 21:05:53,605 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:05:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:05:53,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 16 equivalence classes. [2025-02-07 21:05:53,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 21:05:53,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-02-07 21:05:53,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:05:53,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:05:53,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 21:05:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 21:05:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:05:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:05:53,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:05:53,657 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:05:53,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:05:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:05:53,661 INFO L422 BasicCegarLoop]: Path program histogram: [11, 1] [2025-02-07 21:05:53,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:05:53,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:05:53 BoogieIcfgContainer [2025-02-07 21:05:53,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:05:53,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:05:53,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:05:53,689 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:05:53,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:05:23" (3/4) ... [2025-02-07 21:05:53,690 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:05:53,721 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 50. [2025-02-07 21:05:53,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:05:53,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:05:53,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:05:53,778 INFO L158 Benchmark]: Toolchain (without parser) took 30896.20ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 110.0MB in the beginning and 295.5MB in the end (delta: -185.5MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,778 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:05:53,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.71ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 99.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.30ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.3MB in the end (delta: 679.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:05:53,779 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,779 INFO L158 Benchmark]: IcfgBuilder took 209.78ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 87.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,780 INFO L158 Benchmark]: TraceAbstraction took 30344.56ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.0MB in the beginning and 299.8MB in the end (delta: -213.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,780 INFO L158 Benchmark]: Witness Printer took 88.35ms. Allocated memory is still 369.1MB. Free memory was 299.8MB in the beginning and 295.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:05:53,781 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.71ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 99.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.30ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.3MB in the end (delta: 679.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 209.78ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 87.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30344.56ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.0MB in the beginning and 299.8MB in the end (delta: -213.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 88.35ms. Allocated memory is still 369.1MB. Free memory was 299.8MB in the beginning and 295.5MB in the end (delta: 4.3MB). 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 15; VAL [input=15] [L13] CALL, EXPR id(input) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=15] [L13] int result = id(input); [L14] COND TRUE result == 15 VAL [input=15] [L15] reach_error() VAL [input=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 589 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 811 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 110 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 830 SyntacticMatches, 77 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4315 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=11, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 4294 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 2076/5502 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-07 21:05:53,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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