./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/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-?-c00e63d-m [2025-02-05 10:08:55,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:08:55,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:08:55,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:08:55,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:08:55,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:08:55,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:08:55,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:08:55,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:08:55,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:08:55,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:08:55,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:08:55,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:08:55,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:08:55,351 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:08:55,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:08:55,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:08:55,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:08:55,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:08:55,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:08:55,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:08:55,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:08:55,355 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-05 10:08:55,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:08:55,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:08:55,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:08:55,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:08:55,605 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:08:55,606 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-05 10:08:56,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99eefa54b/28f8103762b34c02b80f40a2db21fe94/FLAG3b5e3ed95 [2025-02-05 10:08:57,107 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:08:57,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c [2025-02-05 10:08:57,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99eefa54b/28f8103762b34c02b80f40a2db21fe94/FLAG3b5e3ed95 [2025-02-05 10:08:57,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99eefa54b/28f8103762b34c02b80f40a2db21fe94 [2025-02-05 10:08:57,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:08:57,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:08:57,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:08:57,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:08:57,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:08:57,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d6ecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57, skipping insertion in model container [2025-02-05 10:08:57,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:08:57,306 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-05 10:08:57,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:08:57,344 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:08:57,355 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-05 10:08:57,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:08:57,385 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:08:57,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57 WrapperNode [2025-02-05 10:08:57,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:08:57,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:08:57,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:08:57,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:08:57,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,425 INFO L138 Inliner]: procedures = 15, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-02-05 10:08:57,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:08:57,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:08:57,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:08:57,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:08:57,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,459 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-05 10:08:57,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:08:57,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:08:57,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:08:57,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:08:57,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (1/1) ... [2025-02-05 10:08:57,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:08:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:57,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:08:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:08:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:08:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:08:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:08:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:08:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:08:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:08:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:08:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:08:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:08:57,607 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:08:57,609 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:08:57,815 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 10:08:57,815 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:08:57,822 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:08:57,824 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:08:57,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:08:57 BoogieIcfgContainer [2025-02-05 10:08:57,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:08:57,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:08:57,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:08:57,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:08:57,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:08:57" (1/3) ... [2025-02-05 10:08:57,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af24a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:08:57, skipping insertion in model container [2025-02-05 10:08:57,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:08:57" (2/3) ... [2025-02-05 10:08:57,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af24a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:08:57, skipping insertion in model container [2025-02-05 10:08:57,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:08:57" (3/3) ... [2025-02-05 10:08:57,836 INFO L128 eAbstractionObserver]: Analyzing ICFG pr5.c [2025-02-05 10:08:57,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:08:57,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr5.c that has 1 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:08:57,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:08:57,907 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;@606c313b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:08:57,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:08:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:08:57,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:57,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:57,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -185930181, now seen corresponding path program 1 times [2025-02-05 10:08:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:57,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591488584] [2025-02-05 10:08:57,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:57,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:57,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:08:58,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:08:58,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:58,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591488584] [2025-02-05 10:08:58,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591488584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:58,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:58,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:08:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079544758] [2025-02-05 10:08:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:58,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:08:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:58,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:08:58,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:08:58,107 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:58,121 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2025-02-05 10:08:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:08:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2025-02-05 10:08:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:58,128 INFO L225 Difference]: With dead ends: 43 [2025-02-05 10:08:58,128 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:08:58,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:08:58,133 INFO L435 NwaCegarLoop]: 33 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, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:58,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:08:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:08:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 10:08:58,153 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-05 10:08:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-02-05 10:08:58,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2025-02-05 10:08:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:58,158 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-02-05 10:08:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2025-02-05 10:08:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:08:58,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:58,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:58,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:08:58,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1556880154, now seen corresponding path program 1 times [2025-02-05 10:08:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:58,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11848562] [2025-02-05 10:08:58,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:08:58,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:08:58,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:58,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11848562] [2025-02-05 10:08:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11848562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:08:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:08:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:08:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330979765] [2025-02-05 10:08:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:08:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:08:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:58,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:08:58,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:08:58,456 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:58,546 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2025-02-05 10:08:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:08:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-02-05 10:08:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:58,547 INFO L225 Difference]: With dead ends: 34 [2025-02-05 10:08:58,547 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 10:08:58,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:08:58,548 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:58,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:08:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 10:08:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-02-05 10:08:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2025-02-05 10:08:58,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2025-02-05 10:08:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:58,553 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2025-02-05 10:08:58,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:08:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2025-02-05 10:08:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:08:58,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:58,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:08:58,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2058531603, now seen corresponding path program 1 times [2025-02-05 10:08:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795872621] [2025-02-05 10:08:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:58,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:08:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:08:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:59,265 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-05 10:08:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795872621] [2025-02-05 10:08:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795872621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450431826] [2025-02-05 10:08:59,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:59,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:08:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:08:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:08:59,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:08:59,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:59,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:59,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 10:08:59,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:59,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:08:59,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:08:59,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:08:59,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:08:59,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:08:59,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:08:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:08:59,668 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-05 10:08:59,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:59,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:08:59,760 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-05 10:08:59,778 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-05 10:08:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450431826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:59,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 17 [2025-02-05 10:08:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593551272] [2025-02-05 10:08:59,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 10:08:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:59,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 10:08:59,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:08:59,784 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:00,422 INFO L93 Difference]: Finished difference Result 109 states and 155 transitions. [2025-02-05 10:09:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:09:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:09:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:00,423 INFO L225 Difference]: With dead ends: 109 [2025-02-05 10:09:00,423 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 10:09:00,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:09:00,425 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 195 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:00,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 119 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:09:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 10:09:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 31. [2025-02-05 10:09:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2025-02-05 10:09:00,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 19 [2025-02-05 10:09:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:00,438 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2025-02-05 10:09:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2025-02-05 10:09:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:09:00,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:00,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:00,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:09:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:00,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2058561394, now seen corresponding path program 1 times [2025-02-05 10:09:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603778035] [2025-02-05 10:09:00,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:00,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:09:00,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:09:00,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:00,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:00,705 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-05 10:09:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603778035] [2025-02-05 10:09:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603778035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:00,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:00,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:09:00,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158181246] [2025-02-05 10:09:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:00,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:09:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:00,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:09:00,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:09:00,706 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:00,720 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2025-02-05 10:09:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:09:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:09:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:00,721 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:09:00,721 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 10:09:00,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:09:00,722 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:00,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 10:09:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 10:09:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-02-05 10:09:00,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 19 [2025-02-05 10:09:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:00,727 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-02-05 10:09:00,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-02-05 10:09:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:09:00,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:00,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:09:00,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:00,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2107352974, now seen corresponding path program 1 times [2025-02-05 10:09:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650407605] [2025-02-05 10:09:00,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:00,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:09:00,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:09:00,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:00,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:01,095 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-05 10:09:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650407605] [2025-02-05 10:09:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650407605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983507939] [2025-02-05 10:09:01,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:01,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:01,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:01,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:09:01,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:09:01,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:09:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:01,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 10:09:01,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:01,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:01,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:01,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:01,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-05 10:09:01,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 19 treesize of output 18 [2025-02-05 10:09:01,356 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-05 10:09:01,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:01,413 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-05 10:09:01,416 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-05 10:09:01,430 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-05 10:09:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983507939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:01,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:01,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 17 [2025-02-05 10:09:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308515843] [2025-02-05 10:09:01,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:01,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 10:09:01,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:01,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 10:09:01,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:09:01,431 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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-05 10:09:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:02,178 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2025-02-05 10:09:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 10:09:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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 19 [2025-02-05 10:09:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:02,181 INFO L225 Difference]: With dead ends: 110 [2025-02-05 10:09:02,181 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 10:09:02,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1229, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 10:09:02,182 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:02,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 103 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:09:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 10:09:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 42. [2025-02-05 10:09:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2025-02-05 10:09:02,194 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 19 [2025-02-05 10:09:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:02,194 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-02-05 10:09:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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-05 10:09:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2025-02-05 10:09:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:09:02,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:02,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:02,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:02,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:02,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1092615621, now seen corresponding path program 1 times [2025-02-05 10:09:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695653315] [2025-02-05 10:09:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:02,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:09:02,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:09:02,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:02,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:02,855 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-05 10:09:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695653315] [2025-02-05 10:09:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695653315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953106304] [2025-02-05 10:09:02,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:02,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:02,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:09:02,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:09:02,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:09:02,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:02,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:02,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:09:02,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:09:03,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:03,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:03,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:03,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:03,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:09:03,239 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-05 10:09:03,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:03,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:03,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:03,399 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-05 10:09:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953106304] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:03,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2025-02-05 10:09:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017096799] [2025-02-05 10:09:03,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 10:09:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:03,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 10:09:03,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:09:03,402 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:04,496 INFO L93 Difference]: Finished difference Result 207 states and 305 transitions. [2025-02-05 10:09:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 10:09:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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 24 [2025-02-05 10:09:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:04,498 INFO L225 Difference]: With dead ends: 207 [2025-02-05 10:09:04,498 INFO L226 Difference]: Without dead ends: 189 [2025-02-05 10:09:04,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=538, Invalid=2114, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 10:09:04,501 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 382 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:04,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 149 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:09:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-05 10:09:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 67. [2025-02-05 10:09:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 66 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-02-05 10:09:04,512 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 24 [2025-02-05 10:09:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-02-05 10:09:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-02-05 10:09:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:09:04,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:04,513 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, 1] [2025-02-05 10:09:04,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:04,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:04,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1557614362, now seen corresponding path program 1 times [2025-02-05 10:09:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606727063] [2025-02-05 10:09:04,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:04,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:09:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:09:04,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:04,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:09:04,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606727063] [2025-02-05 10:09:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606727063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:09:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597994588] [2025-02-05 10:09:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:09:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:04,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:09:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:09:04,796 INFO L87 Difference]: Start difference. First operand 67 states and 101 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-05 10:09:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:04,838 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2025-02-05 10:09:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:09:04,838 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 24 [2025-02-05 10:09:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:04,839 INFO L225 Difference]: With dead ends: 101 [2025-02-05 10:09:04,840 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 10:09:04,840 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-05 10:09:04,842 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 10:09:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2025-02-05 10:09:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2025-02-05 10:09:04,855 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 24 [2025-02-05 10:09:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2025-02-05 10:09:04,855 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-05 10:09:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2025-02-05 10:09:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:09:04,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:04,856 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, 1] [2025-02-05 10:09:04,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:09:04,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:04,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1052055737, now seen corresponding path program 1 times [2025-02-05 10:09:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077181445] [2025-02-05 10:09:04,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:04,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:09:04,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:09:04,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:05,220 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-05 10:09:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077181445] [2025-02-05 10:09:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077181445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716817546] [2025-02-05 10:09:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:05,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:05,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:05,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:09:05,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:09:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:09:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 10:09:05,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:05,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:05,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:05,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:05,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:05,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:09:05,561 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-05 10:09:05,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:05,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:05,656 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-05 10:09:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716817546] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:05,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 21 [2025-02-05 10:09:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929336609] [2025-02-05 10:09:05,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:05,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:09:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:05,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:09:05,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:09:05,658 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:06,622 INFO L93 Difference]: Finished difference Result 291 states and 412 transitions. [2025-02-05 10:09:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 10:09:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 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 24 [2025-02-05 10:09:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:06,623 INFO L225 Difference]: With dead ends: 291 [2025-02-05 10:09:06,623 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 10:09:06,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2774, Unknown=0, NotChecked=0, Total=3422 [2025-02-05 10:09:06,626 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 179 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:06,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 114 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:09:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 10:09:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 119. [2025-02-05 10:09:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-02-05 10:09:06,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 24 [2025-02-05 10:09:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-02-05 10:09:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-02-05 10:09:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:09:06,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:06,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:06,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:06,842 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,SelfDestructingSolverStorable7 [2025-02-05 10:09:06,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1221377349, now seen corresponding path program 1 times [2025-02-05 10:09:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864497513] [2025-02-05 10:09:06,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:06,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:06,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:09:06,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:09:06,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:06,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:06,875 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-05 10:09:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864497513] [2025-02-05 10:09:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864497513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086939883] [2025-02-05 10:09:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:06,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:06,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:06,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:06,877 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:06,905 INFO L93 Difference]: Finished difference Result 164 states and 224 transitions. [2025-02-05 10:09:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 26 [2025-02-05 10:09:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:06,906 INFO L225 Difference]: With dead ends: 164 [2025-02-05 10:09:06,906 INFO L226 Difference]: Without dead ends: 97 [2025-02-05 10:09:06,907 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-05 10:09:06,907 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 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-05 10:09:06,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-05 10:09:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2025-02-05 10:09:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2025-02-05 10:09:06,916 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 26 [2025-02-05 10:09:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:06,916 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2025-02-05 10:09:06,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2025-02-05 10:09:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:09:06,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:06,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:06,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:09:06,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 569240595, now seen corresponding path program 2 times [2025-02-05 10:09:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:06,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-02-05 10:09:06,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:06,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-05 10:09:06,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:06,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:06,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:07,219 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-05 10:09:07,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-02-05 10:09:07,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5324697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:07,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5320596] [2025-02-05 10:09:07,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:07,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:07,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:09:07,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-05 10:09:07,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:07,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:07,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:07,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:09:07,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:09:07,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:07,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:07,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:09:07,626 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-05 10:09:07,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:07,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:07,787 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-05 10:09:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5320596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:07,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-02-05 10:09:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902952499] [2025-02-05 10:09:07,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:07,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 10:09:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:07,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 10:09:07,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-02-05 10:09:07,788 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:09,061 INFO L93 Difference]: Finished difference Result 399 states and 539 transitions. [2025-02-05 10:09:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 10:09:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 29 [2025-02-05 10:09:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:09,063 INFO L225 Difference]: With dead ends: 399 [2025-02-05 10:09:09,063 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 10:09:09,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=926, Invalid=4186, Unknown=0, NotChecked=0, Total=5112 [2025-02-05 10:09:09,065 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 626 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:09,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 196 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:09:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 10:09:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 169. [2025-02-05 10:09:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.369047619047619) internal successors, (230), 168 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2025-02-05 10:09:09,089 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 29 [2025-02-05 10:09:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:09,089 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2025-02-05 10:09:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2025-02-05 10:09:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:09:09,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:09,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:09,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:09:09,291 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,SelfDestructingSolverStorable9 [2025-02-05 10:09:09,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:09,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:09,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1372081294, now seen corresponding path program 1 times [2025-02-05 10:09:09,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:09,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605331693] [2025-02-05 10:09:09,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:09,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:09:09,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:09,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:09,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:09,344 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-05 10:09:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605331693] [2025-02-05 10:09:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605331693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:09:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677319761] [2025-02-05 10:09:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:09,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:09:09,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:09,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:09:09,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:09:09,348 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:09,397 INFO L93 Difference]: Finished difference Result 233 states and 312 transitions. [2025-02-05 10:09:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:09:09,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2025-02-05 10:09:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:09,399 INFO L225 Difference]: With dead ends: 233 [2025-02-05 10:09:09,399 INFO L226 Difference]: Without dead ends: 192 [2025-02-05 10:09:09,400 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-05 10:09:09,401 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:09,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 46 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-05 10:09:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 169. [2025-02-05 10:09:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3571428571428572) internal successors, (228), 168 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions. [2025-02-05 10:09:09,424 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 29 [2025-02-05 10:09:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:09,425 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 228 transitions. [2025-02-05 10:09:09,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions. [2025-02-05 10:09:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:09:09,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:09,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:09,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:09:09,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:09,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2078414131, now seen corresponding path program 1 times [2025-02-05 10:09:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892812705] [2025-02-05 10:09:09,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:09,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:09:09,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:09,479 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-05 10:09:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892812705] [2025-02-05 10:09:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892812705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:09:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926628441] [2025-02-05 10:09:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:09:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:09:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:09:09,481 INFO L87 Difference]: Start difference. First operand 169 states and 228 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:09,523 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2025-02-05 10:09:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:09:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2025-02-05 10:09:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:09,525 INFO L225 Difference]: With dead ends: 203 [2025-02-05 10:09:09,525 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 10:09:09,527 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-05 10:09:09,528 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:09,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 10:09:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2025-02-05 10:09:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2025-02-05 10:09:09,542 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 29 [2025-02-05 10:09:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:09,542 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2025-02-05 10:09:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2025-02-05 10:09:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:09:09,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:09,543 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, 1] [2025-02-05 10:09:09,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:09:09,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -197747789, now seen corresponding path program 1 times [2025-02-05 10:09:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199032856] [2025-02-05 10:09:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:09,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:09:09,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:09,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:09,792 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-05 10:09:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199032856] [2025-02-05 10:09:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199032856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748547814] [2025-02-05 10:09:09,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:09,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:09,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:09:09,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:09:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:09:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:09,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:09,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:09:09,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:09,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:09,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:09,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:09:10,183 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-05 10:09:10,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:10,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:10,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:10,241 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-05 10:09:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748547814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:10,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 9] total 22 [2025-02-05 10:09:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797667948] [2025-02-05 10:09:10,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 10:09:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 10:09:10,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:09:10,243 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:11,223 INFO L93 Difference]: Finished difference Result 379 states and 489 transitions. [2025-02-05 10:09:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 10:09:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 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 29 [2025-02-05 10:09:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:11,225 INFO L225 Difference]: With dead ends: 379 [2025-02-05 10:09:11,225 INFO L226 Difference]: Without dead ends: 377 [2025-02-05 10:09:11,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=699, Invalid=3461, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 10:09:11,227 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 149 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:11,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 157 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:09:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-05 10:09:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 176. [2025-02-05 10:09:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.32) internal successors, (231), 175 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2025-02-05 10:09:11,246 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 29 [2025-02-05 10:09:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:11,246 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2025-02-05 10:09:11,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2025-02-05 10:09:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 10:09:11,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:11,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:11,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:09:11,450 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-05 10:09:11,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash -169602543, now seen corresponding path program 1 times [2025-02-05 10:09:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494645379] [2025-02-05 10:09:11,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 10:09:11,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 10:09:11,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:11,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:11,482 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-05 10:09:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494645379] [2025-02-05 10:09:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494645379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038055093] [2025-02-05 10:09:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:11,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:11,483 INFO L87 Difference]: Start difference. First operand 176 states and 231 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-05 10:09:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:11,520 INFO L93 Difference]: Finished difference Result 205 states and 262 transitions. [2025-02-05 10:09:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:11,521 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 31 [2025-02-05 10:09:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:11,522 INFO L225 Difference]: With dead ends: 205 [2025-02-05 10:09:11,522 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 10:09:11,522 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-05 10:09:11,522 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 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-05 10:09:11,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 10:09:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2025-02-05 10:09:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 159 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2025-02-05 10:09:11,541 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 31 [2025-02-05 10:09:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:11,541 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2025-02-05 10:09:11,541 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-05 10:09:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2025-02-05 10:09:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 10:09:11,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:11,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:09:11,542 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:11,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:11,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1463785157, now seen corresponding path program 3 times [2025-02-05 10:09:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834973695] [2025-02-05 10:09:11,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:11,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-05 10:09:11,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:09:11,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:09:11,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:11,862 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-05 10:09:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834973695] [2025-02-05 10:09:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834973695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312840678] [2025-02-05 10:09:11,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:09:11,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:11,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:11,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:09:11,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:09:11,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-02-05 10:09:11,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:09:11,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:09:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 10:09:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:12,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-05 10:09:12,039 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 23 treesize of output 22 [2025-02-05 10:09:12,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:12,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-02-05 10:09:12,229 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-05 10:09:12,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:12,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:12,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:12,394 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-05 10:09:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312840678] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:12,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 29 [2025-02-05 10:09:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325250973] [2025-02-05 10:09:12,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 10:09:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:12,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 10:09:12,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2025-02-05 10:09:12,395 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:14,721 INFO L93 Difference]: Finished difference Result 464 states and 584 transitions. [2025-02-05 10:09:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-02-05 10:09:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 10:09:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:14,723 INFO L225 Difference]: With dead ends: 464 [2025-02-05 10:09:14,723 INFO L226 Difference]: Without dead ends: 436 [2025-02-05 10:09:14,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3328 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1601, Invalid=9111, Unknown=0, NotChecked=0, Total=10712 [2025-02-05 10:09:14,726 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 311 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:14,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 225 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:09:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-05 10:09:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 174. [2025-02-05 10:09:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.30635838150289) internal successors, (226), 173 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 226 transitions. [2025-02-05 10:09:14,745 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 226 transitions. Word has length 34 [2025-02-05 10:09:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:14,745 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 226 transitions. [2025-02-05 10:09:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 226 transitions. [2025-02-05 10:09:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 10:09:14,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:14,746 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, 1] [2025-02-05 10:09:14,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:09:14,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:14,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 275293978, now seen corresponding path program 1 times [2025-02-05 10:09:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794298629] [2025-02-05 10:09:14,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:14,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 10:09:14,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:09:14,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:14,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:15,199 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-05 10:09:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794298629] [2025-02-05 10:09:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794298629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687866050] [2025-02-05 10:09:15,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:15,202 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-05 10:09:15,204 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-05 10:09:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 10:09:15,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:09:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:15,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 10:09:15,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:15,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:15,557 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-05 10:09:15,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:15,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:15,676 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-05 10:09:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687866050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:15,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 27 [2025-02-05 10:09:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913017112] [2025-02-05 10:09:15,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:15,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 10:09:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:15,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 10:09:15,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-02-05 10:09:15,678 INFO L87 Difference]: Start difference. First operand 174 states and 226 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:17,126 INFO L93 Difference]: Finished difference Result 724 states and 934 transitions. [2025-02-05 10:09:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-02-05 10:09:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 10:09:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:17,129 INFO L225 Difference]: With dead ends: 724 [2025-02-05 10:09:17,129 INFO L226 Difference]: Without dead ends: 722 [2025-02-05 10:09:17,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1109, Invalid=6547, Unknown=0, NotChecked=0, Total=7656 [2025-02-05 10:09:17,132 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 257 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:17,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 193 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:09:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-05 10:09:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 276. [2025-02-05 10:09:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.3236363636363637) internal successors, (364), 275 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2025-02-05 10:09:17,165 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 34 [2025-02-05 10:09:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2025-02-05 10:09:17,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2025-02-05 10:09:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:09:17,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:17,167 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, 1] [2025-02-05 10:09:17,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:09:17,371 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,SelfDestructingSolverStorable15 [2025-02-05 10:09:17,371 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:17,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash -112192551, now seen corresponding path program 1 times [2025-02-05 10:09:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:17,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570327162] [2025-02-05 10:09:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:09:17,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:09:17,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:17,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:17,400 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-05 10:09:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570327162] [2025-02-05 10:09:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570327162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434538813] [2025-02-05 10:09:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:17,403 INFO L87 Difference]: Start difference. First operand 276 states and 364 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-05 10:09:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:17,461 INFO L93 Difference]: Finished difference Result 407 states and 532 transitions. [2025-02-05 10:09:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:17,462 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 36 [2025-02-05 10:09:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:17,463 INFO L225 Difference]: With dead ends: 407 [2025-02-05 10:09:17,464 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 10:09:17,465 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-05 10:09:17,465 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 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-05 10:09:17,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 10:09:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 276. [2025-02-05 10:09:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.298181818181818) internal successors, (357), 275 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 357 transitions. [2025-02-05 10:09:17,513 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 357 transitions. Word has length 36 [2025-02-05 10:09:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 357 transitions. [2025-02-05 10:09:17,513 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-05 10:09:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 357 transitions. [2025-02-05 10:09:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:09:17,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:17,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:09:17,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -959512262, now seen corresponding path program 1 times [2025-02-05 10:09:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730215643] [2025-02-05 10:09:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:17,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:09:17,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:09:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:17,543 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-05 10:09:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730215643] [2025-02-05 10:09:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730215643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121882971] [2025-02-05 10:09:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:17,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:17,546 INFO L87 Difference]: Start difference. First operand 276 states and 357 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-05 10:09:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:17,591 INFO L93 Difference]: Finished difference Result 326 states and 416 transitions. [2025-02-05 10:09:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:17,592 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 36 [2025-02-05 10:09:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:17,593 INFO L225 Difference]: With dead ends: 326 [2025-02-05 10:09:17,594 INFO L226 Difference]: Without dead ends: 244 [2025-02-05 10:09:17,594 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-05 10:09:17,594 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:17,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-05 10:09:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2025-02-05 10:09:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.28125) internal successors, (287), 224 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2025-02-05 10:09:17,624 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 36 [2025-02-05 10:09:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2025-02-05 10:09:17,624 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-05 10:09:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2025-02-05 10:09:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:09:17,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:17,625 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, 1] [2025-02-05 10:09:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:09:17,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash 657843475, now seen corresponding path program 4 times [2025-02-05 10:09:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395384384] [2025-02-05 10:09:17,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:17,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:09:17,644 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:09:17,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:17,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:17,865 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-05 10:09:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395384384] [2025-02-05 10:09:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395384384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717866172] [2025-02-05 10:09:17,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:09:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:17,867 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-05 10:09:17,869 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-05 10:09:17,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:09:17,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:09:17,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:09:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:17,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 10:09:17,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:17,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:18,253 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-05 10:09:18,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:18,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:18,365 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-05 10:09:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717866172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:18,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 26 [2025-02-05 10:09:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528019394] [2025-02-05 10:09:18,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 10:09:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:18,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 10:09:18,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-02-05 10:09:18,367 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:20,080 INFO L93 Difference]: Finished difference Result 670 states and 825 transitions. [2025-02-05 10:09:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-05 10:09:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 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 39 [2025-02-05 10:09:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:20,083 INFO L225 Difference]: With dead ends: 670 [2025-02-05 10:09:20,083 INFO L226 Difference]: Without dead ends: 668 [2025-02-05 10:09:20,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=858, Invalid=5622, Unknown=0, NotChecked=0, Total=6480 [2025-02-05 10:09:20,085 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:20,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 281 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 10:09:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-05 10:09:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 357. [2025-02-05 10:09:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.297752808988764) internal successors, (462), 356 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2025-02-05 10:09:20,130 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 39 [2025-02-05 10:09:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:20,130 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2025-02-05 10:09:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2025-02-05 10:09:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:09:20,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:20,133 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, 1] [2025-02-05 10:09:20,140 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-05 10:09:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:20,337 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 912580020, now seen corresponding path program 1 times [2025-02-05 10:09:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445619074] [2025-02-05 10:09:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:09:20,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:09:20,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:20,582 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-05 10:09:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445619074] [2025-02-05 10:09:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445619074] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121348784] [2025-02-05 10:09:20,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:20,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:20,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:20,584 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-05 10:09:20,585 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-05 10:09:20,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:09:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:09:20,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:20,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:20,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 10:09:20,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:20,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:09:20,878 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-05 10:09:20,880 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-05 10:09:20,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:20,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:20,993 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-05 10:09:21,011 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-05 10:09:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121348784] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:21,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-02-05 10:09:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016074662] [2025-02-05 10:09:21,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 10:09:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:21,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 10:09:21,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-02-05 10:09:21,013 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 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-05 10:09:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:22,995 INFO L93 Difference]: Finished difference Result 883 states and 1109 transitions. [2025-02-05 10:09:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-05 10:09:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 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 39 [2025-02-05 10:09:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:23,000 INFO L225 Difference]: With dead ends: 883 [2025-02-05 10:09:23,000 INFO L226 Difference]: Without dead ends: 769 [2025-02-05 10:09:23,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1062, Invalid=5580, Unknown=0, NotChecked=0, Total=6642 [2025-02-05 10:09:23,004 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 374 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:23,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 251 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:09:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-05 10:09:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 470. [2025-02-05 10:09:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.2729211087420043) internal successors, (597), 469 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 597 transitions. [2025-02-05 10:09:23,070 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 597 transitions. Word has length 39 [2025-02-05 10:09:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:23,070 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 597 transitions. [2025-02-05 10:09:23,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 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-05 10:09:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 597 transitions. [2025-02-05 10:09:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 10:09:23,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:23,071 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, 1] [2025-02-05 10:09:23,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:09:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:23,272 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:23,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -963521934, now seen corresponding path program 1 times [2025-02-05 10:09:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192862177] [2025-02-05 10:09:23,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:23,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 10:09:23,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 10:09:23,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:23,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:23,299 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-05 10:09:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192862177] [2025-02-05 10:09:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192862177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:23,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995231432] [2025-02-05 10:09:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:23,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:23,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:23,301 INFO L87 Difference]: Start difference. First operand 470 states and 597 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:23,374 INFO L93 Difference]: Finished difference Result 734 states and 913 transitions. [2025-02-05 10:09:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 10:09:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:23,376 INFO L225 Difference]: With dead ends: 734 [2025-02-05 10:09:23,376 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 10:09:23,377 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-05 10:09:23,377 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 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-05 10:09:23,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 10:09:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 471. [2025-02-05 10:09:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.2468085106382978) internal successors, (586), 470 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 586 transitions. [2025-02-05 10:09:23,449 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 586 transitions. Word has length 41 [2025-02-05 10:09:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:23,449 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 586 transitions. [2025-02-05 10:09:23,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 586 transitions. [2025-02-05 10:09:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:09:23,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:23,450 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:23,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:09:23,450 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:23,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash 709337402, now seen corresponding path program 5 times [2025-02-05 10:09:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:23,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388670713] [2025-02-05 10:09:23,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:23,459 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 6 equivalence classes. [2025-02-05 10:09:23,466 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:09:23,466 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:09:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:23,671 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-05 10:09:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388670713] [2025-02-05 10:09:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388670713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436726741] [2025-02-05 10:09:23,672 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:09:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:23,674 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-05 10:09:23,676 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-05 10:09:23,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 6 equivalence classes. [2025-02-05 10:09:23,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:09:23,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:09:23,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:23,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:09:23,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:24,105 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-05 10:09:24,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:24,249 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-05 10:09:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436726741] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:24,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:24,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2025-02-05 10:09:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145519963] [2025-02-05 10:09:24,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:24,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 10:09:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:24,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 10:09:24,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2025-02-05 10:09:24,250 INFO L87 Difference]: Start difference. First operand 471 states and 586 transitions. Second operand has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:24,492 INFO L93 Difference]: Finished difference Result 672 states and 811 transitions. [2025-02-05 10:09:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:09:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 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 44 [2025-02-05 10:09:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:24,494 INFO L225 Difference]: With dead ends: 672 [2025-02-05 10:09:24,494 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 10:09:24,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 10:09:24,496 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 184 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:24,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 142 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:09:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 10:09:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 479. [2025-02-05 10:09:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.2301255230125523) internal successors, (588), 478 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 588 transitions. [2025-02-05 10:09:24,559 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 588 transitions. Word has length 44 [2025-02-05 10:09:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:24,559 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 588 transitions. [2025-02-05 10:09:24,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.870967741935484) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 588 transitions. [2025-02-05 10:09:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 10:09:24,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:24,560 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, 1] [2025-02-05 10:09:24,568 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-05 10:09:24,761 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,SelfDestructingSolverStorable21 [2025-02-05 10:09:24,761 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:24,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:24,761 INFO L85 PathProgramCache]: Analyzing trace with hash -689433293, now seen corresponding path program 6 times [2025-02-05 10:09:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222041415] [2025-02-05 10:09:24,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:09:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:24,770 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 6 equivalence classes. [2025-02-05 10:09:24,792 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:09:24,792 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-05 10:09:24,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:25,537 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-05 10:09:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222041415] [2025-02-05 10:09:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222041415] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055963746] [2025-02-05 10:09:25,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:09:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:25,540 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-05 10:09:25,541 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-05 10:09:25,602 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 6 equivalence classes. [2025-02-05 10:09:25,682 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:09:25,682 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-05 10:09:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 10:09:25,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:25,733 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-05 10:09:25,758 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-05 10:09:25,765 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-05 10:09:25,772 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-05 10:09:25,777 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 23 treesize of output 22 [2025-02-05 10:09:26,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:26,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-02-05 10:09:26,055 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-05 10:09:26,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:26,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:26,287 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-05 10:09:26,296 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-05 10:09:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055963746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:26,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:26,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 35 [2025-02-05 10:09:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980553062] [2025-02-05 10:09:26,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:26,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 10:09:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:26,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 10:09:26,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 10:09:26,298 INFO L87 Difference]: Start difference. First operand 479 states and 588 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:30,145 INFO L93 Difference]: Finished difference Result 917 states and 1083 transitions. [2025-02-05 10:09:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-02-05 10:09:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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 51 [2025-02-05 10:09:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:30,148 INFO L225 Difference]: With dead ends: 917 [2025-02-05 10:09:30,148 INFO L226 Difference]: Without dead ends: 908 [2025-02-05 10:09:30,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6630 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1922, Invalid=17538, Unknown=0, NotChecked=0, Total=19460 [2025-02-05 10:09:30,151 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 443 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:30,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 406 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 10:09:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-02-05 10:09:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 496. [2025-02-05 10:09:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.2222222222222223) internal successors, (605), 495 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 605 transitions. [2025-02-05 10:09:30,225 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 605 transitions. Word has length 51 [2025-02-05 10:09:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:30,225 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 605 transitions. [2025-02-05 10:09:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 605 transitions. [2025-02-05 10:09:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 10:09:30,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:30,227 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:30,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 10:09:30,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:30,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2077463150, now seen corresponding path program 1 times [2025-02-05 10:09:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464354310] [2025-02-05 10:09:30,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:30,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:09:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:09:30,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:30,821 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-05 10:09:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464354310] [2025-02-05 10:09:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464354310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081161372] [2025-02-05 10:09:30,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:30,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:30,823 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-05 10:09:30,826 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-05 10:09:30,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:09:30,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:09:30,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:30,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:30,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 10:09:30,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:31,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:31,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:31,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:31,407 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-05 10:09:31,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:31,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:31,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:31,516 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-05 10:09:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081161372] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:31,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 31 [2025-02-05 10:09:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307891796] [2025-02-05 10:09:31,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 10:09:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:31,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 10:09:31,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-02-05 10:09:31,517 INFO L87 Difference]: Start difference. First operand 496 states and 605 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:34,604 INFO L93 Difference]: Finished difference Result 1594 states and 1898 transitions. [2025-02-05 10:09:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-02-05 10:09:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 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 51 [2025-02-05 10:09:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:34,608 INFO L225 Difference]: With dead ends: 1594 [2025-02-05 10:09:34,608 INFO L226 Difference]: Without dead ends: 1592 [2025-02-05 10:09:34,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8841 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2337, Invalid=20919, Unknown=0, NotChecked=0, Total=23256 [2025-02-05 10:09:34,610 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 361 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 343 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 10:09:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-02-05 10:09:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 962. [2025-02-05 10:09:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.2133194588969822) internal successors, (1166), 961 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1166 transitions. [2025-02-05 10:09:34,754 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1166 transitions. Word has length 51 [2025-02-05 10:09:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:34,755 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1166 transitions. [2025-02-05 10:09:34,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1166 transitions. [2025-02-05 10:09:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 10:09:34,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:34,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:34,765 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-05 10:09:34,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:34,961 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:34,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1618519788, now seen corresponding path program 2 times [2025-02-05 10:09:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099701364] [2025-02-05 10:09:34,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:34,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-05 10:09:34,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:09:34,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:34,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:09:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099701364] [2025-02-05 10:09:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099701364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:09:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:09:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:09:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830685979] [2025-02-05 10:09:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:09:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:09:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:35,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:09:35,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:09:35,004 INFO L87 Difference]: Start difference. First operand 962 states and 1166 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-05 10:09:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:35,145 INFO L93 Difference]: Finished difference Result 1137 states and 1373 transitions. [2025-02-05 10:09:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:09:35,146 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 55 [2025-02-05 10:09:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:35,148 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 10:09:35,149 INFO L226 Difference]: Without dead ends: 855 [2025-02-05 10:09:35,149 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-05 10:09:35,149 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 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-05 10:09:35,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:09:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-05 10:09:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 782. [2025-02-05 10:09:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.1997439180537772) internal successors, (937), 781 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 937 transitions. [2025-02-05 10:09:35,335 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 937 transitions. Word has length 55 [2025-02-05 10:09:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:35,335 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 937 transitions. [2025-02-05 10:09:35,335 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-05 10:09:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 937 transitions. [2025-02-05 10:09:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:09:35,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:35,339 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:35,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:09:35,339 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:35,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 760411163, now seen corresponding path program 7 times [2025-02-05 10:09:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:35,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224286029] [2025-02-05 10:09:35,340 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:09:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:35,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:09:35,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:09:35,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:35,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:35,809 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-05 10:09:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224286029] [2025-02-05 10:09:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224286029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818857754] [2025-02-05 10:09:35,810 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:09:35,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:35,813 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-05 10:09:35,815 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-05 10:09:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:09:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:09:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:35,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 10:09:35,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:36,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:09:36,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:36,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:36,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:36,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:36,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:09:36,486 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-05 10:09:36,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:36,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:36,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:36,823 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-05 10:09:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818857754] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:36,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:36,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 42 [2025-02-05 10:09:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993576710] [2025-02-05 10:09:36,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:36,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 10:09:36,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:36,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 10:09:36,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 10:09:36,827 INFO L87 Difference]: Start difference. First operand 782 states and 937 transitions. Second operand has 42 states, 42 states have (on average 3.7142857142857144) internal successors, (156), 42 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-05 10:09:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:42,726 INFO L93 Difference]: Finished difference Result 1429 states and 1681 transitions. [2025-02-05 10:09:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-02-05 10:09:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.7142857142857144) internal successors, (156), 42 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 56 [2025-02-05 10:09:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:42,729 INFO L225 Difference]: With dead ends: 1429 [2025-02-05 10:09:42,729 INFO L226 Difference]: Without dead ends: 1401 [2025-02-05 10:09:42,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12268 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3673, Invalid=32617, Unknown=0, NotChecked=0, Total=36290 [2025-02-05 10:09:42,732 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 703 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:42,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 510 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 10:09:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-02-05 10:09:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 881. [2025-02-05 10:09:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.1920454545454546) internal successors, (1049), 880 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1049 transitions. [2025-02-05 10:09:42,868 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1049 transitions. Word has length 56 [2025-02-05 10:09:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:42,868 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1049 transitions. [2025-02-05 10:09:42,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.7142857142857144) internal successors, (156), 42 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-05 10:09:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1049 transitions. [2025-02-05 10:09:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:09:42,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:42,870 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, 1] [2025-02-05 10:09:42,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 10:09:43,070 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-05 10:09:43,071 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1262052455, now seen corresponding path program 1 times [2025-02-05 10:09:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016120836] [2025-02-05 10:09:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:09:43,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:09:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:43,445 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-05 10:09:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:43,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016120836] [2025-02-05 10:09:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016120836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276475524] [2025-02-05 10:09:43,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:09:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:43,447 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-05 10:09:43,448 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-05 10:09:43,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:09:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:09:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:09:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:43,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 10:09:43,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:43,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:43,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:43,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:43,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:43,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:09:44,102 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-05 10:09:44,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:44,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:09:44,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:09:44,243 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-05 10:09:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276475524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:44,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:44,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 34 [2025-02-05 10:09:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976865440] [2025-02-05 10:09:44,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:44,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 10:09:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:44,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 10:09:44,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:09:44,245 INFO L87 Difference]: Start difference. First operand 881 states and 1049 transitions. Second operand has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:48,445 INFO L93 Difference]: Finished difference Result 1643 states and 1938 transitions. [2025-02-05 10:09:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2025-02-05 10:09:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 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 56 [2025-02-05 10:09:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:48,449 INFO L225 Difference]: With dead ends: 1643 [2025-02-05 10:09:48,449 INFO L226 Difference]: Without dead ends: 1641 [2025-02-05 10:09:48,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14901 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3713, Invalid=33729, Unknown=0, NotChecked=0, Total=37442 [2025-02-05 10:09:48,451 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 432 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:48,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 353 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 10:09:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-02-05 10:09:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 902. [2025-02-05 10:09:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.1942286348501665) internal successors, (1076), 901 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1076 transitions. [2025-02-05 10:09:48,582 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1076 transitions. Word has length 56 [2025-02-05 10:09:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:48,583 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1076 transitions. [2025-02-05 10:09:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1076 transitions. [2025-02-05 10:09:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 10:09:48,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:48,584 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:09:48,593 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-05 10:09:48,785 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-05 10:09:48,785 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:48,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1461246413, now seen corresponding path program 8 times [2025-02-05 10:09:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226208553] [2025-02-05 10:09:48,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:48,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 10:09:48,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:09:48,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:49,229 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-05 10:09:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226208553] [2025-02-05 10:09:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226208553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936240650] [2025-02-05 10:09:49,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:49,232 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-05 10:09:49,234 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-05 10:09:49,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 10:09:49,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:09:49,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:49,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:49,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 10:09:49,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:49,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:09:49,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:09:49,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:49,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:49,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-02-05 10:09:49,933 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-05 10:09:49,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:09:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-02-05 10:09:50,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-05 10:09:50,286 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-05 10:09:50,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936240650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:09:50,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:09:50,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 45 [2025-02-05 10:09:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048756798] [2025-02-05 10:09:50,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:09:50,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 10:09:50,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:09:50,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 10:09:50,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 10:09:50,288 INFO L87 Difference]: Start difference. First operand 902 states and 1076 transitions. Second operand has 45 states, 45 states have (on average 3.8) internal successors, (171), 45 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:09:58,622 INFO L93 Difference]: Finished difference Result 1803 states and 2107 transitions. [2025-02-05 10:09:58,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2025-02-05 10:09:58,623 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.8) internal successors, (171), 45 states have internal predecessors, (171), 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 61 [2025-02-05 10:09:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:09:58,627 INFO L225 Difference]: With dead ends: 1803 [2025-02-05 10:09:58,627 INFO L226 Difference]: Without dead ends: 1777 [2025-02-05 10:09:58,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21982 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5274, Invalid=53532, Unknown=0, NotChecked=0, Total=58806 [2025-02-05 10:09:58,629 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 686 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 3631 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 4297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 3631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:09:58,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 650 Invalid, 4297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 3631 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 10:09:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-02-05 10:09:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 962. [2025-02-05 10:09:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.1914672216441207) internal successors, (1145), 961 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1145 transitions. [2025-02-05 10:09:58,775 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1145 transitions. Word has length 61 [2025-02-05 10:09:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:09:58,775 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1145 transitions. [2025-02-05 10:09:58,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.8) internal successors, (171), 45 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:09:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1145 transitions. [2025-02-05 10:09:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 10:09:58,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:09:58,777 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, 1] [2025-02-05 10:09:58,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 10:09:58,978 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-05 10:09:58,978 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:09:58,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:09:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1400142125, now seen corresponding path program 2 times [2025-02-05 10:09:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:09:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593319209] [2025-02-05 10:09:58,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:09:58,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 10:09:58,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:09:58,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:58,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:59,371 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-05 10:09:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:09:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593319209] [2025-02-05 10:09:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593319209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:09:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467024263] [2025-02-05 10:09:59,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:09:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:09:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:09:59,373 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-05 10:09:59,374 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-05 10:09:59,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-05 10:09:59,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:09:59,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:09:59,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:09:59,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 10:09:59,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:09:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:09:59,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:09:59,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:09:59,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:10:00,069 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-05 10:10:00,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:00,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:10:00,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:10:00,149 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-05 10:10:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467024263] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:00,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 15] total 34 [2025-02-05 10:10:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295582676] [2025-02-05 10:10:00,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 10:10:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 10:10:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:10:00,151 INFO L87 Difference]: Start difference. First operand 962 states and 1145 transitions. Second operand has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:06,111 INFO L93 Difference]: Finished difference Result 1758 states and 2066 transitions. [2025-02-05 10:10:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2025-02-05 10:10:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 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 61 [2025-02-05 10:10:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:06,115 INFO L225 Difference]: With dead ends: 1758 [2025-02-05 10:10:06,115 INFO L226 Difference]: Without dead ends: 1756 [2025-02-05 10:10:06,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25095 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5433, Invalid=55329, Unknown=0, NotChecked=0, Total=60762 [2025-02-05 10:10:06,118 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 412 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:06,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 522 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 10:10:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-02-05 10:10:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 998. [2025-02-05 10:10:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.1925777331995988) internal successors, (1189), 997 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1189 transitions. [2025-02-05 10:10:06,244 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1189 transitions. Word has length 61 [2025-02-05 10:10:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1189 transitions. [2025-02-05 10:10:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 34 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1189 transitions. [2025-02-05 10:10:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 10:10:06,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:06,246 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:06,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 10:10:06,447 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-05 10:10:06,447 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -988380389, now seen corresponding path program 9 times [2025-02-05 10:10:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679617263] [2025-02-05 10:10:06,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:10:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:06,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 9 equivalence classes. [2025-02-05 10:10:06,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:10:06,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-05 10:10:06,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:07,324 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-05 10:10:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679617263] [2025-02-05 10:10:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679617263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567993585] [2025-02-05 10:10:07,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:10:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:07,326 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-05 10:10:07,327 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-05 10:10:07,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 9 equivalence classes. [2025-02-05 10:10:07,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:10:07,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-05 10:10:07,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:07,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 10:10:07,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:07,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-05 10:10:07,637 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 21 treesize of output 20 [2025-02-05 10:10:07,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-05 10:10:07,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2025-02-05 10:10:07,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-05 10:10:07,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 56 [2025-02-05 10:10:07,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 65 [2025-02-05 10:10:07,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 74 [2025-02-05 10:10:07,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2025-02-05 10:10:08,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:08,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 82 treesize of output 98 [2025-02-05 10:10:09,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 94 treesize of output 28 [2025-02-05 10:10:09,291 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-05 10:10:09,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:22,781 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 85 treesize of output 81 [2025-02-05 10:10:22,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:10:22,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 230