./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pr5.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/array-tiling/pr5.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 374c198ea90130277bd1a124bc94571dd240bc0803e6f3936a68065c719ddd5a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:59:47,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:59:47,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 16:59:47,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:59:47,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:59:47,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:59:47,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:59:47,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:59:47,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:59:47,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:59:47,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:59:47,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:59:47,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:59:47,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:59:47,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:59:47,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:59:47,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:59:47,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:59:47,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:59:47,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:59:47,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:59:47,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:59:47,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:59:47,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:59:47,247 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 -> 374c198ea90130277bd1a124bc94571dd240bc0803e6f3936a68065c719ddd5a [2025-02-07 16:59:47,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:59:47,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:59:47,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:59:47,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:59:47,468 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:59:47,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr5.c [2025-02-07 16:59:48,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dedb1f6f/05db6a596f554486a2cf35b566210125/FLAGd342c7626 [2025-02-07 16:59:48,930 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:59:48,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c [2025-02-07 16:59:48,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dedb1f6f/05db6a596f554486a2cf35b566210125/FLAGd342c7626 [2025-02-07 16:59:49,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dedb1f6f/05db6a596f554486a2cf35b566210125 [2025-02-07 16:59:49,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:59:49,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:59:49,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:59:49,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:59:49,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:59:49,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be505d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49, skipping insertion in model container [2025-02-07 16:59:49,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:59:49,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c[394,407] [2025-02-07 16:59:49,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:59:49,387 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:59:49,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c[394,407] [2025-02-07 16:59:49,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:59:49,409 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:59:49,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49 WrapperNode [2025-02-07 16:59:49,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:59:49,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:59:49,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:59:49,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:59:49,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,429 INFO L138 Inliner]: procedures = 15, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-02-07 16:59:49,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:59:49,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:59:49,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:59:49,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:59:49,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,444 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-02-07 16:59:49,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:59:49,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:59:49,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:59:49,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:59:49,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (1/1) ... [2025-02-07 16:59:49,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:59:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:49,472 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 16:59:49,476 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 16:59:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:59:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:59:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:59:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 16:59:49,534 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:59:49,535 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:59:49,673 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 16:59:49,674 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:59:49,683 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:59:49,683 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:59:49,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:59:49 BoogieIcfgContainer [2025-02-07 16:59:49,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:59:49,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:59:49,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:59:49,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:59:49,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:59:49" (1/3) ... [2025-02-07 16:59:49,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92d587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:59:49, skipping insertion in model container [2025-02-07 16:59:49,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:59:49" (2/3) ... [2025-02-07 16:59:49,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92d587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:59:49, skipping insertion in model container [2025-02-07 16:59:49,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:59:49" (3/3) ... [2025-02-07 16:59:49,693 INFO L128 eAbstractionObserver]: Analyzing ICFG pr5.c [2025-02-07 16:59:49,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:59:49,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr5.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 16:59:49,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:59:49,749 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;@75f31081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:59:49,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:59:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 20 states have (on average 1.65) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:59:49,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:49,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:49,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:49,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2037505948, now seen corresponding path program 1 times [2025-02-07 16:59:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901370054] [2025-02-07 16:59:49,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:49,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:59:49,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:59:49,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:49,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:49,880 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 16:59:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901370054] [2025-02-07 16:59:49,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901370054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:49,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:49,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:59:49,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690954659] [2025-02-07 16:59:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:59:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:49,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:59:49,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:59:49,896 INFO L87 Difference]: Start difference. First operand has 23 states, 20 states have (on average 1.65) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:49,904 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2025-02-07 16:59:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:59:49,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 16:59:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:49,908 INFO L225 Difference]: With dead ends: 41 [2025-02-07 16:59:49,908 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 16:59:49,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:59:49,912 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:49,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 16:59:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 16:59:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-02-07 16:59:49,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 11 [2025-02-07 16:59:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:49,937 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-02-07 16:59:49,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2025-02-07 16:59:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:59:49,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:49,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:49,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:59:49,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:49,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash -514651013, now seen corresponding path program 1 times [2025-02-07 16:59:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338947699] [2025-02-07 16:59:49,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:49,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:59:49,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:59:49,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:49,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:50,141 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 16:59:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338947699] [2025-02-07 16:59:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338947699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:50,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:59:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847942853] [2025-02-07 16:59:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:59:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:50,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:59:50,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:59:50,143 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:50,191 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-02-07 16:59:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:59:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 16:59:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:50,192 INFO L225 Difference]: With dead ends: 33 [2025-02-07 16:59:50,192 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 16:59:50,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:59:50,193 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:50,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 17 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 16:59:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-02-07 16:59:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-02-07 16:59:50,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 11 [2025-02-07 16:59:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:50,197 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-02-07 16:59:50,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2025-02-07 16:59:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 16:59:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:50,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:59:50,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:50,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 168598898, now seen corresponding path program 1 times [2025-02-07 16:59:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541543294] [2025-02-07 16:59:50,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:50,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:50,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:50,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:50,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541543294] [2025-02-07 16:59:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541543294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:59:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073116862] [2025-02-07 16:59:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:50,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:59:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:59:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:59:50,350 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:50,416 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2025-02-07 16:59:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:59:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 16:59:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:50,418 INFO L225 Difference]: With dead ends: 48 [2025-02-07 16:59:50,418 INFO L226 Difference]: Without dead ends: 34 [2025-02-07 16:59:50,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:59:50,419 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:50,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 35 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:59:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-07 16:59:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2025-02-07 16:59:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-02-07 16:59:50,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 18 [2025-02-07 16:59:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:50,423 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-02-07 16:59:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2025-02-07 16:59:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 16:59:50,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:50,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 16:59:50,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:50,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1911409233, now seen corresponding path program 1 times [2025-02-07 16:59:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724990189] [2025-02-07 16:59:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:50,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:50,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:50,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724990189] [2025-02-07 16:59:50,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724990189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:50,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:59:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098179461] [2025-02-07 16:59:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:59:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:50,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:59:50,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:59:50,514 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:50,552 INFO L93 Difference]: Finished difference Result 65 states and 96 transitions. [2025-02-07 16:59:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:59:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 16:59:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:50,553 INFO L225 Difference]: With dead ends: 65 [2025-02-07 16:59:50,553 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 16:59:50,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:59:50,554 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:50,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 16:59:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2025-02-07 16:59:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2025-02-07 16:59:50,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 18 [2025-02-07 16:59:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:50,559 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2025-02-07 16:59:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2025-02-07 16:59:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 16:59:50,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:50,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:50,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 16:59:50,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1976053361, now seen corresponding path program 1 times [2025-02-07 16:59:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106985216] [2025-02-07 16:59:50,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:50,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:50,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:50,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:50,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106985216] [2025-02-07 16:59:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106985216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348951062] [2025-02-07 16:59:51,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:51,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:51,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:51,068 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 16:59:51,070 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 16:59:51,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:51,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:51,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 16:59:51,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:51,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:59:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:51,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:51,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:51,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:51,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 16:59:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:51,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:59:51,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-07 16:59:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348951062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:51,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-02-07 16:59:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61453431] [2025-02-07 16:59:51,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 16:59:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:51,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 16:59:51,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-07 16:59:51,372 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:51,848 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2025-02-07 16:59:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 16:59:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 16:59:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:51,850 INFO L225 Difference]: With dead ends: 134 [2025-02-07 16:59:51,850 INFO L226 Difference]: Without dead ends: 120 [2025-02-07 16:59:51,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 16:59:51,855 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 310 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:51,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 99 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:59:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-07 16:59:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 55. [2025-02-07 16:59:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-02-07 16:59:51,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 18 [2025-02-07 16:59:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:51,865 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-02-07 16:59:51,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-02-07 16:59:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 16:59:51,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:51,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:51,878 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 16:59:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:52,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1976083152, now seen corresponding path program 1 times [2025-02-07 16:59:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465781393] [2025-02-07 16:59:52,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:52,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:52,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:52,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:59:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465781393] [2025-02-07 16:59:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465781393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:59:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50494225] [2025-02-07 16:59:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:52,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:59:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:52,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:59:52,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:59:52,124 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:52,139 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2025-02-07 16:59:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:59:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 16:59:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:52,140 INFO L225 Difference]: With dead ends: 59 [2025-02-07 16:59:52,142 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 16:59:52,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:59:52,142 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:52,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 16:59:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-07 16:59:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2025-02-07 16:59:52,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 18 [2025-02-07 16:59:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2025-02-07 16:59:52,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2025-02-07 16:59:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 16:59:52,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:52,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:52,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 16:59:52,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2040491952, now seen corresponding path program 1 times [2025-02-07 16:59:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851991919] [2025-02-07 16:59:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:52,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:52,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:52,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:52,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:52,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851991919] [2025-02-07 16:59:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851991919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120048294] [2025-02-07 16:59:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:52,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:52,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:52,519 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 16:59:52,521 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 16:59:52,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 16:59:52,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 16:59:52,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:52,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:52,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 16:59:52,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 16:59:52,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:52,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:59:52,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:59:52,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:59:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:52,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:52,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-07 16:59:52,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-07 16:59:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120048294] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:52,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:52,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 7] total 18 [2025-02-07 16:59:52,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004944885] [2025-02-07 16:59:52,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:52,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 16:59:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:52,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 16:59:52,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-07 16:59:52,862 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:53,490 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2025-02-07 16:59:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 16:59:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 16:59:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:53,492 INFO L225 Difference]: With dead ends: 127 [2025-02-07 16:59:53,492 INFO L226 Difference]: Without dead ends: 125 [2025-02-07 16:59:53,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=380, Invalid=1426, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 16:59:53,493 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 155 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:53,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 86 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 16:59:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-07 16:59:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 59. [2025-02-07 16:59:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 58 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2025-02-07 16:59:53,507 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 18 [2025-02-07 16:59:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:53,507 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-02-07 16:59:53,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2025-02-07 16:59:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 16:59:53,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:53,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:53,521 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 16:59:53,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:53,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash -313929189, now seen corresponding path program 1 times [2025-02-07 16:59:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952268407] [2025-02-07 16:59:53,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:53,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 16:59:53,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 16:59:53,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:53,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952268407] [2025-02-07 16:59:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952268407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172759935] [2025-02-07 16:59:53,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:53,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:53,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:53,990 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 16:59:53,991 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 16:59:54,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 16:59:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 16:59:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:54,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 16:59:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:54,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:59:54,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:54,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:54,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 16:59:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:54,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:59:54,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:59:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172759935] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:54,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-02-07 16:59:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081839487] [2025-02-07 16:59:54,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 16:59:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:54,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 16:59:54,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-02-07 16:59:54,373 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:55,344 INFO L93 Difference]: Finished difference Result 316 states and 451 transitions. [2025-02-07 16:59:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-07 16:59:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 16:59:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:55,345 INFO L225 Difference]: With dead ends: 316 [2025-02-07 16:59:55,345 INFO L226 Difference]: Without dead ends: 263 [2025-02-07 16:59:55,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2355, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 16:59:55,347 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 452 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:55,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 153 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 16:59:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-07 16:59:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 109. [2025-02-07 16:59:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 108 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-02-07 16:59:55,355 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 23 [2025-02-07 16:59:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-02-07 16:59:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-02-07 16:59:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 16:59:55,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:55,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:55,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 16:59:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:55,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1537339162, now seen corresponding path program 1 times [2025-02-07 16:59:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073608373] [2025-02-07 16:59:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:55,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 16:59:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 16:59:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073608373] [2025-02-07 16:59:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073608373] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007333724] [2025-02-07 16:59:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:55,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:55,788 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 16:59:55,790 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 16:59:55,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 16:59:55,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 16:59:55,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:55,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:55,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-07 16:59:55,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:55,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 16:59:55,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:55,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:59:55,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:59:55,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:59:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:56,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:56,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:59:56,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:59:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007333724] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:56,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 20 [2025-02-07 16:59:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118790272] [2025-02-07 16:59:56,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 16:59:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:56,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 16:59:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-02-07 16:59:56,114 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:56,983 INFO L93 Difference]: Finished difference Result 309 states and 429 transitions. [2025-02-07 16:59:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-07 16:59:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 16:59:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:56,985 INFO L225 Difference]: With dead ends: 309 [2025-02-07 16:59:56,985 INFO L226 Difference]: Without dead ends: 307 [2025-02-07 16:59:56,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=606, Invalid=2586, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 16:59:56,986 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 144 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:56,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 16:59:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-07 16:59:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 158. [2025-02-07 16:59:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4585987261146496) internal successors, (229), 157 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2025-02-07 16:59:56,997 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 23 [2025-02-07 16:59:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2025-02-07 16:59:56,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2025-02-07 16:59:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 16:59:56,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:56,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:57,008 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 16:59:57,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 16:59:57,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:57,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1970836100, now seen corresponding path program 1 times [2025-02-07 16:59:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911232984] [2025-02-07 16:59:57,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:57,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:57,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 16:59:57,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 16:59:57,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:57,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911232984] [2025-02-07 16:59:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911232984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 16:59:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863009544] [2025-02-07 16:59:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 16:59:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 16:59:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:59:57,233 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:57,254 INFO L93 Difference]: Finished difference Result 195 states and 271 transitions. [2025-02-07 16:59:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 16:59:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 16:59:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:57,255 INFO L225 Difference]: With dead ends: 195 [2025-02-07 16:59:57,255 INFO L226 Difference]: Without dead ends: 140 [2025-02-07 16:59:57,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:59:57,256 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:57,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-07 16:59:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2025-02-07 16:59:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-02-07 16:59:57,264 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 25 [2025-02-07 16:59:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:57,264 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-02-07 16:59:57,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-02-07 16:59:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 16:59:57,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:57,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:57,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 16:59:57,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:57,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1181608113, now seen corresponding path program 2 times [2025-02-07 16:59:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297117220] [2025-02-07 16:59:57,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:57,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-07 16:59:57,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 16:59:57,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:57,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297117220] [2025-02-07 16:59:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297117220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:59:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849529308] [2025-02-07 16:59:57,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:59:57,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:59:57,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:59:57,504 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 16:59:57,506 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 16:59:57,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-07 16:59:57,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 16:59:57,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:59:57,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:57,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 16:59:57,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:59:57,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:59:57,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:57,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 16:59:57,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 16:59:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:57,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:57,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 16:59:57,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 16:59:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849529308] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:57,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-02-07 16:59:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610352666] [2025-02-07 16:59:57,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:57,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 16:59:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:57,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 16:59:57,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-02-07 16:59:57,939 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:59,427 INFO L93 Difference]: Finished difference Result 713 states and 988 transitions. [2025-02-07 16:59:59,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 16:59:59,427 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 16:59:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:59,431 INFO L225 Difference]: With dead ends: 713 [2025-02-07 16:59:59,431 INFO L226 Difference]: Without dead ends: 635 [2025-02-07 16:59:59,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=956, Invalid=4446, Unknown=0, NotChecked=0, Total=5402 [2025-02-07 16:59:59,433 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 487 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:59,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 201 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 16:59:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-02-07 16:59:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 247. [2025-02-07 16:59:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4065040650406504) internal successors, (346), 246 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 346 transitions. [2025-02-07 16:59:59,466 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 346 transitions. Word has length 28 [2025-02-07 16:59:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:59,466 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 346 transitions. [2025-02-07 16:59:59,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 346 transitions. [2025-02-07 16:59:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 16:59:59,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:59,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:59,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 16:59:59,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 16:59:59,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:59,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1693709296, now seen corresponding path program 1 times [2025-02-07 16:59:59,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:59,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891680250] [2025-02-07 16:59:59,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:59,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:59,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 16:59:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 16:59:59,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:59,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:59:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 16:59:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:59:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891680250] [2025-02-07 16:59:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891680250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:59:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:59:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:59:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038639040] [2025-02-07 16:59:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:59:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:59:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:59,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:59:59,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:59:59,724 INFO L87 Difference]: Start difference. First operand 247 states and 346 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:59:59,790 INFO L93 Difference]: Finished difference Result 295 states and 407 transitions. [2025-02-07 16:59:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:59:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 16:59:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:59:59,792 INFO L225 Difference]: With dead ends: 295 [2025-02-07 16:59:59,793 INFO L226 Difference]: Without dead ends: 240 [2025-02-07 16:59:59,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:59:59,793 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:59:59,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:59:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-07 16:59:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 210. [2025-02-07 16:59:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 209 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 284 transitions. [2025-02-07 16:59:59,814 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 284 transitions. Word has length 28 [2025-02-07 16:59:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:59:59,814 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 284 transitions. [2025-02-07 16:59:59,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:59:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 284 transitions. [2025-02-07 16:59:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 16:59:59,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:59:59,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:59:59,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 16:59:59,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:59:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:59:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -582452624, now seen corresponding path program 1 times [2025-02-07 16:59:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:59:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68304638] [2025-02-07 16:59:59,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:59:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:59:59,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 16:59:59,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 16:59:59,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:59:59,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:00,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:00,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68304638] [2025-02-07 17:00:00,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68304638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:00,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098007732] [2025-02-07 17:00:00,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:00,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:00,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:00,011 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 17:00:00,015 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 17:00:00,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 17:00:00,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:00:00,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:00,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:00,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 17:00:00,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:00,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:00,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:00:00,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:00:00,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:00:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:00,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:00,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:00,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098007732] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:00,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 9] total 22 [2025-02-07 17:00:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35317083] [2025-02-07 17:00:00,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 17:00:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:00,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 17:00:00,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-07 17:00:00,388 INFO L87 Difference]: Start difference. First operand 210 states and 284 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:01,264 INFO L93 Difference]: Finished difference Result 435 states and 565 transitions. [2025-02-07 17:00:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-07 17:00:01,264 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 17:00:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:01,266 INFO L225 Difference]: With dead ends: 435 [2025-02-07 17:00:01,266 INFO L226 Difference]: Without dead ends: 433 [2025-02-07 17:00:01,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=699, Invalid=3461, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 17:00:01,267 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 146 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:01,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 130 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 17:00:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-07 17:00:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 266. [2025-02-07 17:00:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.3622641509433961) internal successors, (361), 265 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 361 transitions. [2025-02-07 17:00:01,284 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 361 transitions. Word has length 28 [2025-02-07 17:00:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 361 transitions. [2025-02-07 17:00:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 361 transitions. [2025-02-07 17:00:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 17:00:01,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:01,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:01,291 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 17:00:01,489 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,SelfDestructingSolverStorable12 [2025-02-07 17:00:01,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:01,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash -292410673, now seen corresponding path program 1 times [2025-02-07 17:00:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934895418] [2025-02-07 17:00:01,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 17:00:01,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 17:00:01,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:00:01,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934895418] [2025-02-07 17:00:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934895418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:00:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:00:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:00:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115637373] [2025-02-07 17:00:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:00:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:00:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:01,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:00:01,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:01,514 INFO L87 Difference]: Start difference. First operand 266 states and 361 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:01,569 INFO L93 Difference]: Finished difference Result 348 states and 464 transitions. [2025-02-07 17:00:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:00:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 17:00:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:01,571 INFO L225 Difference]: With dead ends: 348 [2025-02-07 17:00:01,571 INFO L226 Difference]: Without dead ends: 295 [2025-02-07 17:00:01,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:01,571 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:01,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:00:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-07 17:00:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 266. [2025-02-07 17:00:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 265 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 355 transitions. [2025-02-07 17:00:01,594 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 355 transitions. Word has length 30 [2025-02-07 17:00:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:01,594 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 355 transitions. [2025-02-07 17:00:01,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 355 transitions. [2025-02-07 17:00:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 17:00:01,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:01,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 17:00:01,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:01,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1462887985, now seen corresponding path program 2 times [2025-02-07 17:00:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255820012] [2025-02-07 17:00:01,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:01,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-07 17:00:01,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 17:00:01,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:01,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:00:01,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255820012] [2025-02-07 17:00:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255820012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:00:01,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:00:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:00:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333771917] [2025-02-07 17:00:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:00:01,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:00:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:00:01,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:01,637 INFO L87 Difference]: Start difference. First operand 266 states and 355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:01,674 INFO L93 Difference]: Finished difference Result 309 states and 403 transitions. [2025-02-07 17:00:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:00:01,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 17:00:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:01,675 INFO L225 Difference]: With dead ends: 309 [2025-02-07 17:00:01,675 INFO L226 Difference]: Without dead ends: 229 [2025-02-07 17:00:01,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:01,678 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:01,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:00:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-07 17:00:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2025-02-07 17:00:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.294392523364486) internal successors, (277), 214 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 277 transitions. [2025-02-07 17:00:01,693 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 277 transitions. Word has length 30 [2025-02-07 17:00:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 277 transitions. [2025-02-07 17:00:01,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 277 transitions. [2025-02-07 17:00:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:00:01,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:01,694 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 17:00:01,694 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:01,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1906409509, now seen corresponding path program 3 times [2025-02-07 17:00:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524244370] [2025-02-07 17:00:01,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:00:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:01,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-07 17:00:01,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:00:01,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 17:00:01,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:01,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524244370] [2025-02-07 17:00:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524244370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602521883] [2025-02-07 17:00:01,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:00:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:01,943 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 17:00:01,944 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 17:00:01,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-07 17:00:02,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:00:02,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 17:00:02,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:02,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 17:00:02,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:02,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-07 17:00:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-07 17:00:02,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-07 17:00:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:02,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:02,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:02,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 17:00:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602521883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:02,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-02-07 17:00:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723675654] [2025-02-07 17:00:02,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 17:00:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 17:00:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2025-02-07 17:00:02,371 INFO L87 Difference]: Start difference. First operand 215 states and 277 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:04,886 INFO L93 Difference]: Finished difference Result 717 states and 894 transitions. [2025-02-07 17:00:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-02-07 17:00:04,886 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-07 17:00:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:04,898 INFO L225 Difference]: With dead ends: 717 [2025-02-07 17:00:04,898 INFO L226 Difference]: Without dead ends: 642 [2025-02-07 17:00:04,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1609, Invalid=8491, Unknown=0, NotChecked=0, Total=10100 [2025-02-07 17:00:04,905 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 480 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:04,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 232 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 17:00:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-07 17:00:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 254. [2025-02-07 17:00:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.284584980237154) internal successors, (325), 253 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 325 transitions. [2025-02-07 17:00:04,952 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 325 transitions. Word has length 33 [2025-02-07 17:00:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:04,952 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 325 transitions. [2025-02-07 17:00:04,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 325 transitions. [2025-02-07 17:00:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:00:04,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:04,953 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:04,959 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 17:00:05,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:05,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1077434107, now seen corresponding path program 1 times [2025-02-07 17:00:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835083152] [2025-02-07 17:00:05,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:05,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:00:05,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:00:05,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:05,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835083152] [2025-02-07 17:00:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835083152] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286683586] [2025-02-07 17:00:05,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:05,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:05,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:05,441 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 17:00:05,442 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 17:00:05,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:00:05,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:00:05,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:05,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:05,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 17:00:05,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:05,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:05,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:00:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:05,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:05,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:05,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286683586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:05,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 27 [2025-02-07 17:00:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609943521] [2025-02-07 17:00:05,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 17:00:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:05,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 17:00:05,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-02-07 17:00:05,861 INFO L87 Difference]: Start difference. First operand 254 states and 325 transitions. Second operand has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:06,868 INFO L93 Difference]: Finished difference Result 558 states and 688 transitions. [2025-02-07 17:00:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-07 17:00:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-07 17:00:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:06,870 INFO L225 Difference]: With dead ends: 558 [2025-02-07 17:00:06,872 INFO L226 Difference]: Without dead ends: 556 [2025-02-07 17:00:06,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=753, Invalid=3669, Unknown=0, NotChecked=0, Total=4422 [2025-02-07 17:00:06,874 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:06,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 196 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 17:00:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-07 17:00:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 268. [2025-02-07 17:00:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.2771535580524345) internal successors, (341), 267 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2025-02-07 17:00:06,896 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 33 [2025-02-07 17:00:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:06,896 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2025-02-07 17:00:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2025-02-07 17:00:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:00:06,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:06,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:06,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:07,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 17:00:07,101 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1945325370, now seen corresponding path program 1 times [2025-02-07 17:00:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849349862] [2025-02-07 17:00:07,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:07,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 17:00:07,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:00:07,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:07,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:00:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849349862] [2025-02-07 17:00:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849349862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:00:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:00:07,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:00:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318583846] [2025-02-07 17:00:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:00:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:00:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:07,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:00:07,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:07,123 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:07,179 INFO L93 Difference]: Finished difference Result 417 states and 526 transitions. [2025-02-07 17:00:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:00:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 17:00:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:07,180 INFO L225 Difference]: With dead ends: 417 [2025-02-07 17:00:07,180 INFO L226 Difference]: Without dead ends: 318 [2025-02-07 17:00:07,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:07,181 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:07,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:00:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-07 17:00:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 272. [2025-02-07 17:00:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.2509225092250922) internal successors, (339), 271 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 339 transitions. [2025-02-07 17:00:07,202 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 339 transitions. Word has length 35 [2025-02-07 17:00:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:07,202 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 339 transitions. [2025-02-07 17:00:07,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 339 transitions. [2025-02-07 17:00:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:00:07,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:07,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:07,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 17:00:07,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:07,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1386437220, now seen corresponding path program 1 times [2025-02-07 17:00:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:07,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056510493] [2025-02-07 17:00:07,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:07,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 17:00:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:00:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:00:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:07,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056510493] [2025-02-07 17:00:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056510493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:00:07,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:00:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:00:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277303138] [2025-02-07 17:00:07,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:00:07,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:00:07,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:07,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:00:07,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:07,230 INFO L87 Difference]: Start difference. First operand 272 states and 339 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:07,273 INFO L93 Difference]: Finished difference Result 339 states and 417 transitions. [2025-02-07 17:00:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:00:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 17:00:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:07,274 INFO L225 Difference]: With dead ends: 339 [2025-02-07 17:00:07,274 INFO L226 Difference]: Without dead ends: 243 [2025-02-07 17:00:07,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:07,275 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:07,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:00:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-07 17:00:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 206. [2025-02-07 17:00:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 205 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 252 transitions. [2025-02-07 17:00:07,297 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 252 transitions. Word has length 35 [2025-02-07 17:00:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:07,297 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 252 transitions. [2025-02-07 17:00:07,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 252 transitions. [2025-02-07 17:00:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 17:00:07,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:07,298 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:07,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 17:00:07,298 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1344285967, now seen corresponding path program 4 times [2025-02-07 17:00:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92764820] [2025-02-07 17:00:07,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:00:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:07,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-07 17:00:07,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 17:00:07,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:00:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92764820] [2025-02-07 17:00:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92764820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051366586] [2025-02-07 17:00:07,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:00:07,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:07,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:07,593 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 17:00:07,597 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 17:00:07,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-07 17:00:07,677 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 17:00:07,677 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:00:07,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:07,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 17:00:07,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:07,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:07,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:08,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:08,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-02-07 17:00:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051366586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:08,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 29 [2025-02-07 17:00:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574524356] [2025-02-07 17:00:08,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:08,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 17:00:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:08,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 17:00:08,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:00:08,098 INFO L87 Difference]: Start difference. First operand 206 states and 252 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:09,762 INFO L93 Difference]: Finished difference Result 556 states and 655 transitions. [2025-02-07 17:00:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-07 17:00:09,762 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-07 17:00:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:09,767 INFO L225 Difference]: With dead ends: 556 [2025-02-07 17:00:09,767 INFO L226 Difference]: Without dead ends: 547 [2025-02-07 17:00:09,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=980, Invalid=5026, Unknown=0, NotChecked=0, Total=6006 [2025-02-07 17:00:09,768 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 389 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:09,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 172 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 17:00:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-07 17:00:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 223. [2025-02-07 17:00:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2252252252252251) internal successors, (272), 222 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2025-02-07 17:00:09,794 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 38 [2025-02-07 17:00:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:09,795 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2025-02-07 17:00:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2025-02-07 17:00:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 17:00:09,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:09,795 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:09,801 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 17:00:10,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:10,000 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1599022512, now seen corresponding path program 1 times [2025-02-07 17:00:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556130884] [2025-02-07 17:00:10,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:10,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 17:00:10,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 17:00:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556130884] [2025-02-07 17:00:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556130884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151583768] [2025-02-07 17:00:10,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:10,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:10,190 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 17:00:10,194 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 17:00:10,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 17:00:10,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 17:00:10,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:10,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 17:00:10,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:10,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:10,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:10,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:10,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151583768] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:10,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 26 [2025-02-07 17:00:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384308886] [2025-02-07 17:00:10,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 17:00:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:10,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 17:00:10,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-02-07 17:00:10,594 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:12,447 INFO L93 Difference]: Finished difference Result 833 states and 997 transitions. [2025-02-07 17:00:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-02-07 17:00:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-07 17:00:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:12,449 INFO L225 Difference]: With dead ends: 833 [2025-02-07 17:00:12,449 INFO L226 Difference]: Without dead ends: 831 [2025-02-07 17:00:12,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1068, Invalid=7862, Unknown=0, NotChecked=0, Total=8930 [2025-02-07 17:00:12,451 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 154 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:12,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 253 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 17:00:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-02-07 17:00:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 432. [2025-02-07 17:00:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.25754060324826) internal successors, (542), 431 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 542 transitions. [2025-02-07 17:00:12,491 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 542 transitions. Word has length 38 [2025-02-07 17:00:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 542 transitions. [2025-02-07 17:00:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 542 transitions. [2025-02-07 17:00:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 17:00:12,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:12,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:12,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:12,696 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -853251025, now seen corresponding path program 1 times [2025-02-07 17:00:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555566121] [2025-02-07 17:00:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 17:00:12,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 17:00:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-07 17:00:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555566121] [2025-02-07 17:00:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555566121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:00:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:00:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:00:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344868140] [2025-02-07 17:00:12,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:00:12,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:00:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:12,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:00:12,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:12,723 INFO L87 Difference]: Start difference. First operand 432 states and 542 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:12,819 INFO L93 Difference]: Finished difference Result 486 states and 605 transitions. [2025-02-07 17:00:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:00:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-07 17:00:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:12,822 INFO L225 Difference]: With dead ends: 486 [2025-02-07 17:00:12,822 INFO L226 Difference]: Without dead ends: 366 [2025-02-07 17:00:12,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:00:12,824 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:00:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-07 17:00:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 352. [2025-02-07 17:00:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.2336182336182335) internal successors, (433), 351 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 433 transitions. [2025-02-07 17:00:12,863 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 433 transitions. Word has length 40 [2025-02-07 17:00:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:12,864 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 433 transitions. [2025-02-07 17:00:12,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 433 transitions. [2025-02-07 17:00:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 17:00:12,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:12,865 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:12,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 17:00:12,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:12,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash 516226459, now seen corresponding path program 5 times [2025-02-07 17:00:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240587643] [2025-02-07 17:00:12,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:00:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:12,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 6 equivalence classes. [2025-02-07 17:00:12,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 17:00:12,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 17:00:12,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240587643] [2025-02-07 17:00:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240587643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803716469] [2025-02-07 17:00:13,047 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:00:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:13,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:00:13,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:00:13,099 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 6 equivalence classes. [2025-02-07 17:00:13,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 17:00:13,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 17:00:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:13,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 17:00:13,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:13,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803716469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:13,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2025-02-07 17:00:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344845521] [2025-02-07 17:00:13,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 17:00:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:13,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 17:00:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2025-02-07 17:00:13,586 INFO L87 Difference]: Start difference. First operand 352 states and 433 transitions. Second operand has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:13,823 INFO L93 Difference]: Finished difference Result 565 states and 677 transitions. [2025-02-07 17:00:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:00:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-07 17:00:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:13,824 INFO L225 Difference]: With dead ends: 565 [2025-02-07 17:00:13,824 INFO L226 Difference]: Without dead ends: 430 [2025-02-07 17:00:13,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 17:00:13,825 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 296 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:13,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 141 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:00:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-07 17:00:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 369. [2025-02-07 17:00:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.2119565217391304) internal successors, (446), 368 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 446 transitions. [2025-02-07 17:00:13,902 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 446 transitions. Word has length 43 [2025-02-07 17:00:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:13,902 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 446 transitions. [2025-02-07 17:00:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.838709677419355) internal successors, (119), 31 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 446 transitions. [2025-02-07 17:00:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 17:00:13,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:13,903 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:13,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:00:14,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-07 17:00:14,104 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1539622801, now seen corresponding path program 6 times [2025-02-07 17:00:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756130493] [2025-02-07 17:00:14,104 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:00:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:14,121 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 6 equivalence classes. [2025-02-07 17:00:14,146 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 17:00:14,146 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-07 17:00:14,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756130493] [2025-02-07 17:00:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756130493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539047878] [2025-02-07 17:00:14,558 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:00:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:14,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:14,560 INFO L229 MonitoredProcess]: Starting monitored process 13 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 17:00:14,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:00:14,612 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 6 equivalence classes. [2025-02-07 17:00:14,685 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 17:00:14,685 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-07 17:00:14,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:14,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 17:00:14,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 17:00:14,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:14,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:14,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:15,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:15,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:15,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 17:00:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539047878] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:15,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2025-02-07 17:00:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379637053] [2025-02-07 17:00:15,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 17:00:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 17:00:15,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 17:00:15,464 INFO L87 Difference]: Start difference. First operand 369 states and 446 transitions. Second operand has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 38 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:20,236 INFO L93 Difference]: Finished difference Result 964 states and 1110 transitions. [2025-02-07 17:00:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-02-07 17:00:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 38 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-07 17:00:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:20,238 INFO L225 Difference]: With dead ends: 964 [2025-02-07 17:00:20,238 INFO L226 Difference]: Without dead ends: 895 [2025-02-07 17:00:20,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3016, Invalid=22744, Unknown=0, NotChecked=0, Total=25760 [2025-02-07 17:00:20,242 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 979 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:20,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 506 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 17:00:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-07 17:00:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 516. [2025-02-07 17:00:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.1766990291262136) internal successors, (606), 515 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 606 transitions. [2025-02-07 17:00:20,323 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 606 transitions. Word has length 50 [2025-02-07 17:00:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 606 transitions. [2025-02-07 17:00:20,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 38 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 606 transitions. [2025-02-07 17:00:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 17:00:20,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:20,324 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:20,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:20,525 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 832340816, now seen corresponding path program 2 times [2025-02-07 17:00:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491529174] [2025-02-07 17:00:20,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:20,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-07 17:00:20,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 17:00:20,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:20,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491529174] [2025-02-07 17:00:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491529174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398999673] [2025-02-07 17:00:20,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:20,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:20,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:20,777 INFO L229 MonitoredProcess]: Starting monitored process 14 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 17:00:20,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-07 17:00:20,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-07 17:00:20,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 17:00:20,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:20,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 17:00:20,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:20,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:20,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:20,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:20,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:00:20,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:00:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:00:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:21,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:21,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398999673] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:21,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 32 [2025-02-07 17:00:21,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408929294] [2025-02-07 17:00:21,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 17:00:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:21,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 17:00:21,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2025-02-07 17:00:21,424 INFO L87 Difference]: Start difference. First operand 516 states and 606 transitions. Second operand has 32 states, 32 states have (on average 3.53125) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:24,406 INFO L93 Difference]: Finished difference Result 1015 states and 1163 transitions. [2025-02-07 17:00:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-02-07 17:00:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-07 17:00:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:24,408 INFO L225 Difference]: With dead ends: 1015 [2025-02-07 17:00:24,408 INFO L226 Difference]: Without dead ends: 1013 [2025-02-07 17:00:24,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10294 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2799, Invalid=23933, Unknown=0, NotChecked=0, Total=26732 [2025-02-07 17:00:24,411 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 318 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 2975 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:24,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 290 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2975 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 17:00:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-07 17:00:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 586. [2025-02-07 17:00:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.1777777777777778) internal successors, (689), 585 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2025-02-07 17:00:24,498 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 50 [2025-02-07 17:00:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:24,499 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2025-02-07 17:00:24,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2025-02-07 17:00:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 17:00:24,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:24,499 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:24,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-07 17:00:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:24,700 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1327502085, now seen corresponding path program 7 times [2025-02-07 17:00:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330046431] [2025-02-07 17:00:24,700 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:00:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:24,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 17:00:24,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 17:00:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330046431] [2025-02-07 17:00:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330046431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443344871] [2025-02-07 17:00:25,018 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:00:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:25,020 INFO L229 MonitoredProcess]: Starting monitored process 15 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 17:00:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-07 17:00:25,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 17:00:25,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 17:00:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:25,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 17:00:25,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 17:00:25,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:25,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:25,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:25,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:25,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:25,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 17:00:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443344871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:26,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 43 [2025-02-07 17:00:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612225970] [2025-02-07 17:00:26,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-07 17:00:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:26,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-07 17:00:26,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 17:00:26,071 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:32,565 INFO L93 Difference]: Finished difference Result 1257 states and 1448 transitions. [2025-02-07 17:00:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2025-02-07 17:00:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-07 17:00:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:32,567 INFO L225 Difference]: With dead ends: 1257 [2025-02-07 17:00:32,567 INFO L226 Difference]: Without dead ends: 1156 [2025-02-07 17:00:32,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12528 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4107, Invalid=33335, Unknown=0, NotChecked=0, Total=37442 [2025-02-07 17:00:32,570 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 924 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:32,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 405 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 17:00:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-02-07 17:00:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 626. [2025-02-07 17:00:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.1648) internal successors, (728), 625 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 728 transitions. [2025-02-07 17:00:32,647 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 728 transitions. Word has length 55 [2025-02-07 17:00:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:32,647 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 728 transitions. [2025-02-07 17:00:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 728 transitions. [2025-02-07 17:00:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 17:00:32,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:32,648 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:32,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-07 17:00:32,855 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1382623738, now seen corresponding path program 1 times [2025-02-07 17:00:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306718936] [2025-02-07 17:00:32,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:32,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 17:00:32,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 17:00:32,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:32,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306718936] [2025-02-07 17:00:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306718936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199245955] [2025-02-07 17:00:33,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:00:33,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:33,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:33,119 INFO L229 MonitoredProcess]: Starting monitored process 16 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 17:00:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-07 17:00:33,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 17:00:33,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 17:00:33,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:00:33,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:33,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-07 17:00:33,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:33,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:33,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:33,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:00:33,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:00:33,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:00:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:33,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:33,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:33,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199245955] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:33,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:33,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 34 [2025-02-07 17:00:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108584693] [2025-02-07 17:00:33,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 17:00:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:33,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 17:00:33,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 17:00:33,849 INFO L87 Difference]: Start difference. First operand 626 states and 728 transitions. Second operand has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:37,290 INFO L93 Difference]: Finished difference Result 1058 states and 1207 transitions. [2025-02-07 17:00:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-02-07 17:00:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-07 17:00:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:37,293 INFO L225 Difference]: With dead ends: 1058 [2025-02-07 17:00:37,293 INFO L226 Difference]: Without dead ends: 1056 [2025-02-07 17:00:37,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11847 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3123, Invalid=27677, Unknown=0, NotChecked=0, Total=30800 [2025-02-07 17:00:37,295 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 306 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:37,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 375 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 17:00:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-07 17:00:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 605. [2025-02-07 17:00:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.1622516556291391) internal successors, (702), 604 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 702 transitions. [2025-02-07 17:00:37,416 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 702 transitions. Word has length 55 [2025-02-07 17:00:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:37,416 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 702 transitions. [2025-02-07 17:00:37,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 702 transitions. [2025-02-07 17:00:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:00:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:37,417 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:37,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-07 17:00:37,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-07 17:00:37,622 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:37,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash 752196049, now seen corresponding path program 8 times [2025-02-07 17:00:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293537310] [2025-02-07 17:00:37,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:37,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-07 17:00:37,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:00:37,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:37,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293537310] [2025-02-07 17:00:37,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293537310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505768997] [2025-02-07 17:00:37,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:37,953 INFO L229 MonitoredProcess]: Starting monitored process 17 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 17:00:37,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-07 17:00:38,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-07 17:00:38,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:00:38,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:38,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 17:00:38,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:38,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 17:00:38,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:38,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 17:00:38,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:00:38,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-02-07 17:00:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:38,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:38,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 17:00:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505768997] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:38,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:38,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 45 [2025-02-07 17:00:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174277486] [2025-02-07 17:00:38,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:38,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-07 17:00:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:38,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-07 17:00:38,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1800, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 17:00:38,983 INFO L87 Difference]: Start difference. First operand 605 states and 702 transitions. Second operand has 45 states, 45 states have (on average 3.7777777777777777) internal successors, (170), 45 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:45,542 INFO L93 Difference]: Finished difference Result 1343 states and 1534 transitions. [2025-02-07 17:00:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2025-02-07 17:00:45,543 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.7777777777777777) internal successors, (170), 45 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-07 17:00:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:45,545 INFO L225 Difference]: With dead ends: 1343 [2025-02-07 17:00:45,545 INFO L226 Difference]: Without dead ends: 1312 [2025-02-07 17:00:45,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17734 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5160, Invalid=44346, Unknown=0, NotChecked=0, Total=49506 [2025-02-07 17:00:45,548 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 750 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 931 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 931 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:45,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 475 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [931 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 17:00:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-02-07 17:00:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 682. [2025-02-07 17:00:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.158590308370044) internal successors, (789), 681 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 789 transitions. [2025-02-07 17:00:45,690 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 789 transitions. Word has length 60 [2025-02-07 17:00:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:45,690 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 789 transitions. [2025-02-07 17:00:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.7777777777777777) internal successors, (170), 45 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 789 transitions. [2025-02-07 17:00:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:00:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:45,696 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:45,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:45,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-07 17:00:45,897 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 968535440, now seen corresponding path program 2 times [2025-02-07 17:00:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123075190] [2025-02-07 17:00:45,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:45,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-07 17:00:45,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:00:45,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123075190] [2025-02-07 17:00:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123075190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695008687] [2025-02-07 17:00:46,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:00:46,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:46,358 INFO L229 MonitoredProcess]: Starting monitored process 18 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 17:00:46,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-07 17:00:46,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-07 17:00:46,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:00:46,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:00:46,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:46,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 17:00:46,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:46,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:00:46,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:00:46,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:00:46,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:00:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:47,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:47,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:00:47,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:00:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695008687] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:47,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 15] total 34 [2025-02-07 17:00:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867120404] [2025-02-07 17:00:47,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 17:00:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:47,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 17:00:47,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 17:00:47,138 INFO L87 Difference]: Start difference. First operand 682 states and 789 transitions. Second operand has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 34 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:00:52,509 INFO L93 Difference]: Finished difference Result 1133 states and 1290 transitions. [2025-02-07 17:00:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2025-02-07 17:00:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 34 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-07 17:00:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:00:52,512 INFO L225 Difference]: With dead ends: 1133 [2025-02-07 17:00:52,512 INFO L226 Difference]: Without dead ends: 1131 [2025-02-07 17:00:52,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21395 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4948, Invalid=48182, Unknown=0, NotChecked=0, Total=53130 [2025-02-07 17:00:52,514 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 348 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:00:52,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 494 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 17:00:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-02-07 17:00:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 682. [2025-02-07 17:00:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.158590308370044) internal successors, (789), 681 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 789 transitions. [2025-02-07 17:00:52,603 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 789 transitions. Word has length 60 [2025-02-07 17:00:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:00:52,603 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 789 transitions. [2025-02-07 17:00:52,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 34 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:00:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 789 transitions. [2025-02-07 17:00:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-07 17:00:52,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:00:52,604 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:00:52,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-07 17:00:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-07 17:00:52,809 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:00:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:00:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -793214277, now seen corresponding path program 9 times [2025-02-07 17:00:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:00:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301736512] [2025-02-07 17:00:52,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:00:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:00:52,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 9 equivalence classes. [2025-02-07 17:00:52,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 65 of 65 statements. [2025-02-07 17:00:52,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 17:00:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:00:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301736512] [2025-02-07 17:00:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301736512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:00:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838257162] [2025-02-07 17:00:55,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:00:55,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:00:55,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:00:55,708 INFO L229 MonitoredProcess]: Starting monitored process 19 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 17:00:55,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-07 17:00:55,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 9 equivalence classes. [2025-02-07 17:00:55,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 65 of 65 statements. [2025-02-07 17:00:55,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 17:00:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:00:55,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 17:00:55,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:00:55,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-07 17:00:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-07 17:00:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 16 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:56,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:00:56,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-07 17:00:56,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-07 17:00:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 16 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:00:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838257162] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:00:56,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:00:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 17] total 54 [2025-02-07 17:00:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215303261] [2025-02-07 17:00:56,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:00:56,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-07 17:00:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:00:56,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-07 17:00:56,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2649, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 17:00:56,999 INFO L87 Difference]: Start difference. First operand 682 states and 789 transitions. Second operand has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:01:12,712 INFO L93 Difference]: Finished difference Result 1722 states and 1957 transitions. [2025-02-07 17:01:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2025-02-07 17:01:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-07 17:01:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:01:12,715 INFO L225 Difference]: With dead ends: 1722 [2025-02-07 17:01:12,715 INFO L226 Difference]: Without dead ends: 1351 [2025-02-07 17:01:12,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26341 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=7082, Invalid=66088, Unknown=0, NotChecked=0, Total=73170 [2025-02-07 17:01:12,720 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1015 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 4881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-07 17:01:12,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 591 Invalid, 4881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-07 17:01:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-07 17:01:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 733. [2025-02-07 17:01:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.157103825136612) internal successors, (847), 732 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 847 transitions. [2025-02-07 17:01:12,849 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 847 transitions. Word has length 65 [2025-02-07 17:01:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:01:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 847 transitions. [2025-02-07 17:01:12,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.462962962962963) internal successors, (187), 54 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 847 transitions. [2025-02-07 17:01:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-07 17:01:12,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:01:12,851 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:01:12,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-07 17:01:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:01:13,055 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:01:13,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:01:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash -296433840, now seen corresponding path program 1 times [2025-02-07 17:01:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:01:13,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426445352] [2025-02-07 17:01:13,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:01:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:01:13,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-07 17:01:13,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 17:01:13,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:01:13,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:01:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-07 17:01:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:01:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426445352] [2025-02-07 17:01:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426445352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:01:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:01:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:01:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266187450] [2025-02-07 17:01:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:01:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:01:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:01:13,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:01:13,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:01:13,094 INFO L87 Difference]: Start difference. First operand 733 states and 847 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:01:13,213 INFO L93 Difference]: Finished difference Result 970 states and 1118 transitions. [2025-02-07 17:01:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:01:13,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-07 17:01:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:01:13,215 INFO L225 Difference]: With dead ends: 970 [2025-02-07 17:01:13,215 INFO L226 Difference]: Without dead ends: 497 [2025-02-07 17:01:13,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:01:13,216 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:01:13,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:01:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-07 17:01:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 392. [2025-02-07 17:01:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.1355498721227621) internal successors, (444), 391 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 444 transitions. [2025-02-07 17:01:13,278 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 444 transitions. Word has length 66 [2025-02-07 17:01:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:01:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 444 transitions. [2025-02-07 17:01:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:01:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 444 transitions. [2025-02-07 17:01:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 17:01:13,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:01:13,279 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:01:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 17:01:13,279 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:01:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:01:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 665007216, now seen corresponding path program 2 times [2025-02-07 17:01:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:01:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820496398] [2025-02-07 17:01:13,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:01:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:01:13,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-07 17:01:13,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:01:13,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:01:13,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:01:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 140 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:01:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:01:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820496398] [2025-02-07 17:01:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820496398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:01:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178573406] [2025-02-07 17:01:13,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:01:13,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:01:13,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:01:13,785 INFO L229 MonitoredProcess]: Starting monitored process 20 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 17:01:13,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-07 17:01:13,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-07 17:01:13,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:01:13,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:01:13,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:01:13,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 17:01:13,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:01:13,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:01:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:01:14,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:01:14,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 17:01:14,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:01:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:01:14,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178573406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:01:14,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:01:14,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 52 [2025-02-07 17:01:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335974304] [2025-02-07 17:01:14,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:01:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-07 17:01:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:01:14,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-07 17:01:14,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2428, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 17:01:14,736 INFO L87 Difference]: Start difference. First operand 392 states and 444 transitions. Second operand has 52 states, 52 states have (on average 3.9038461538461537) internal successors, (203), 52 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)