/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-30 00:13:56,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-30 00:13:56,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-30 00:13:56,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-30 00:13:56,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-30 00:13:56,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-30 00:13:56,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-30 00:13:56,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-30 00:13:56,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-30 00:13:56,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-30 00:13:56,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * Use SBE=true [2025-01-30 00:13:56,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-30 00:13:56,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-30 00:13:56,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-30 00:13:56,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:13:56,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-30 00:13:56,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-30 00:13:56,946 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-30 00:13:56,946 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-30 00:13:56,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-30 00:13:57,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-30 00:13:57,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-30 00:13:57,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-30 00:13:57,249 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-30 00:13:57,250 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-30 00:13:57,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl [2025-01-30 00:13:57,251 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl' [2025-01-30 00:13:57,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-30 00:13:57,279 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-30 00:13:57,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-30 00:13:57,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-30 00:13:57,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-30 00:13:57,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,303 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-30 00:13:57,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-30 00:13:57,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-30 00:13:57,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-30 00:13:57,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-30 00:13:57,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-30 00:13:57,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-30 00:13:57,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-30 00:13:57,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-30 00:13:57,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/1) ... [2025-01-30 00:13:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:13:57,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:13:57,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-30 00:13:57,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-30 00:13:57,398 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-30 00:13:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-30 00:13:57,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-30 00:13:57,398 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-30 00:13:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-30 00:13:57,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-30 00:13:57,398 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-30 00:13:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-30 00:13:57,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-30 00:13:57,400 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-30 00:13:57,447 INFO L234 CfgBuilder]: Building ICFG [2025-01-30 00:13:57,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-30 00:13:57,543 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-30 00:13:57,543 INFO L283 CfgBuilder]: Performing block encoding [2025-01-30 00:13:57,570 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-30 00:13:57,574 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-30 00:13:57,575 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:57 BoogieIcfgContainer [2025-01-30 00:13:57,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-30 00:13:57,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-30 00:13:57,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-30 00:13:57,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-30 00:13:57,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:13:57" (1/2) ... [2025-01-30 00:13:57,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b8e87 and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:13:57, skipping insertion in model container [2025-01-30 00:13:57,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:57" (2/2) ... [2025-01-30 00:13:57,586 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2025-01-30 00:13:57,602 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-30 00:13:57,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.bpl that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-30 00:13:57,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-30 00:13:57,647 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-30 00:13:57,689 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:13:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-30 00:13:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:13:57,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-30 00:13:57,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-30 00:13:57,752 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-30 00:13:57,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-30 00:13:57,778 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=PARTIAL_ORDER_FA, 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;@607dbd91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:13:57,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-30 00:13:57,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:13:57,847 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:13:57,847 INFO L139 ounterexampleChecker]: Examining path program with hash 1534107289, occurence #1 [2025-01-30 00:13:57,847 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:13:57,847 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:13:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:13:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -138855266, now seen corresponding path program 1 times [2025-01-30 00:13:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:13:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20318933] [2025-01-30 00:13:57,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:13:57,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-30 00:13:57,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-30 00:13:57,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:57,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:13:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:13:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:13:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20318933] [2025-01-30 00:13:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20318933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:13:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:13:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:13:58,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554175894] [2025-01-30 00:13:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:13:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:13:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:13:58,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:13:58,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:13:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:58,150 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:13:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-01-30 00:13:58,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-30 00:13:58,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:13:58,235 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:13:58,235 INFO L139 ounterexampleChecker]: Examining path program with hash 886743451, occurence #1 [2025-01-30 00:13:58,235 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:13:58,235 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:13:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:13:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 611274844, now seen corresponding path program 1 times [2025-01-30 00:13:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:13:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781036336] [2025-01-30 00:13:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:13:58,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-30 00:13:58,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-30 00:13:58,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:58,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:13:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:13:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:13:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781036336] [2025-01-30 00:13:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781036336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:13:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:13:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:13:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127950327] [2025-01-30 00:13:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:13:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:13:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:13:58,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:13:58,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:13:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:58,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:13:58,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-01-30 00:13:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:58,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-30 00:13:58,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:13:58,403 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:13:58,404 INFO L139 ounterexampleChecker]: Examining path program with hash 886743451, occurence #2 [2025-01-30 00:13:58,404 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:13:58,404 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:13:58,427 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:13:58,427 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:13:58,427 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:13:58,428 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-01-30 00:13:58,428 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:13:58,428 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-01-30 00:13:58,428 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:13:58,428 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-30 00:13:58,428 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:13:58,428 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-30 00:13:58,428 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:13:58,428 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:13:58,428 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:13:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:13:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1553993677, now seen corresponding path program 1 times [2025-01-30 00:13:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:13:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275274523] [2025-01-30 00:13:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:13:58,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-30 00:13:58,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-30 00:13:58,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:58,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:13:58,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223542967] [2025-01-30 00:13:58,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:58,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:13:58,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:13:58,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:13:58,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-30 00:13:58,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-30 00:13:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-30 00:13:58,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:58,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:13:58,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-30 00:13:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:13:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:13:58,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:13:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:13:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:13:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275274523] [2025-01-30 00:13:59,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:13:59,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223542967] [2025-01-30 00:13:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223542967] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:13:59,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:13:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-01-30 00:13:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755673829] [2025-01-30 00:13:59,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:13:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-30 00:13:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:13:59,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-30 00:13:59,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-30 00:13:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:59,094 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:13:59,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-01-30 00:13:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:13:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:13:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:13:59,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-30 00:13:59,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:13:59,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:13:59,521 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:13:59,522 INFO L139 ounterexampleChecker]: Examining path program with hash -190954116, occurence #1 [2025-01-30 00:13:59,522 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:13:59,522 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:13:59,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:13:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1413423709, now seen corresponding path program 1 times [2025-01-30 00:13:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:13:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368722519] [2025-01-30 00:13:59,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:13:59,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-30 00:13:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-30 00:13:59,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:59,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:13:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026352864] [2025-01-30 00:13:59,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:13:59,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:13:59,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:13:59,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:13:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-30 00:13:59,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-30 00:13:59,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-30 00:13:59,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:13:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:13:59,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-30 00:13:59,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:13:59,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:13:59,686 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 13 treesize of output 9 [2025-01-30 00:13:59,691 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 17 treesize of output 13 [2025-01-30 00:13:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:13:59,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:14:00,072 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 46 treesize of output 42 [2025-01-30 00:14:01,015 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-30 00:14:01,016 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 18 treesize of output 18 [2025-01-30 00:14:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:14:01,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:14:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368722519] [2025-01-30 00:14:01,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:14:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026352864] [2025-01-30 00:14:01,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026352864] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:14:01,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:14:01,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-30 00:14:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333412981] [2025-01-30 00:14:01,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:14:01,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-30 00:14:01,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:14:01,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-30 00:14:01,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-30 00:14:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:14:01,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:14:01,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-01-30 00:14:01,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:01,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:01,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:14:01,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:14:03,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:05,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:14:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:14:05,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-30 00:14:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:14:06,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:14:06,162 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:14:06,162 INFO L139 ounterexampleChecker]: Examining path program with hash -190954116, occurence #2 [2025-01-30 00:14:06,162 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:14:06,162 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:14:06,162 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:14:06,162 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:14:06,162 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:14:06,162 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-01-30 00:14:06,162 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:14:06,162 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-30 00:14:06,162 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:14:06,163 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-30 00:14:06,163 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:14:06,163 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-30 00:14:06,163 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:14:06,163 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-30 00:14:06,163 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:14:06,163 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-30 00:14:06,163 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:14:06,163 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:14:06,163 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:14:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:14:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -416615154, now seen corresponding path program 2 times [2025-01-30 00:14:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:14:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867715873] [2025-01-30 00:14:06,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:14:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:14:06,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-30 00:14:06,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-30 00:14:06,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:14:06,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:14:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873685666] [2025-01-30 00:14:06,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:14:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:14:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:14:06,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:14:06,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-30 00:14:06,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-30 00:14:06,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-30 00:14:06,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:14:06,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:14:06,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-30 00:14:06,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:14:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:14:06,340 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 13 treesize of output 9 [2025-01-30 00:14:06,343 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 17 treesize of output 13 [2025-01-30 00:14:06,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:14:06,412 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 18 treesize of output 13 [2025-01-30 00:14:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:14:06,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:14:07,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:14:07,528 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-30 00:14:07,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:14:07,555 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 48 treesize of output 51 [2025-01-30 00:14:07,574 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 15 treesize of output 13 [2025-01-30 00:14:08,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:14:08,244 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 57 treesize of output 62 [2025-01-30 00:14:08,253 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 68 treesize of output 62 [2025-01-30 00:14:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:14:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:14:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867715873] [2025-01-30 00:14:08,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:14:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873685666] [2025-01-30 00:14:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873685666] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:14:08,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:14:08,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-01-30 00:14:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882593944] [2025-01-30 00:14:08,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:14:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-30 00:14:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:14:08,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-30 00:14:08,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=378, Unknown=2, NotChecked=0, Total=462 [2025-01-30 00:14:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:14:08,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:14:08,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-30 00:14:08,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:08,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:14:08,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:14:08,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:14:08,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:14:13,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:17,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:19,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:23,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:25,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:29,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:35,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:38,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:40,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:42,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:44,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:46,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:48,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:50,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:56,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:14:59,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:01,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:04,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:06,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:07,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:09,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:11,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:15:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:15:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:15:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:15:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:15:11,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-30 00:15:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:15:12,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:15:12,173 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:15:12,173 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #1 [2025-01-30 00:15:12,173 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:15:12,173 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:15:12,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:15:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2051357228, now seen corresponding path program 3 times [2025-01-30 00:15:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:15:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233878408] [2025-01-30 00:15:12,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:15:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:15:12,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-30 00:15:12,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:15:12,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-30 00:15:12,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:15:12,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22304235] [2025-01-30 00:15:12,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:15:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:15:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:15:12,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:15:12,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-30 00:15:12,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-30 00:15:12,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:15:12,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-30 00:15:12,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:15:12,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-30 00:15:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:15:12,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:15:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-01-30 00:15:12,311 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 13 treesize of output 9 [2025-01-30 00:15:12,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:15:12,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2025-01-30 00:15:12,414 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 41 treesize of output 25 [2025-01-30 00:15:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:15:12,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:15:13,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:15:13,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-01-30 00:15:13,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:15:13,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:15:13,294 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 57 treesize of output 61 [2025-01-30 00:15:13,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:15:13,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-30 00:15:13,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-01-30 00:15:13,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:15:13,328 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 35 treesize of output 39 [2025-01-30 00:15:34,285 INFO L349 Elim1Store]: treesize reduction 10, result has 56.5 percent of original size [2025-01-30 00:15:34,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 27 treesize of output 30 [2025-01-30 00:15:34,342 INFO L349 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2025-01-30 00:15:34,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2025-01-30 00:15:34,362 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:15:34,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:15:34,380 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2025-01-30 00:15:34,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2025-01-30 00:15:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:15:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:15:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233878408] [2025-01-30 00:15:34,429 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:15:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22304235] [2025-01-30 00:15:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22304235] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:15:34,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:15:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-01-30 00:15:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277025518] [2025-01-30 00:15:34,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:15:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-30 00:15:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:15:34,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-30 00:15:34,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=414, Unknown=10, NotChecked=0, Total=506 [2025-01-30 00:15:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:15:34,431 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:15:34,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:15:34,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:15:45,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:53,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:15:55,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:00,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:02,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:33,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:35,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:37,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:39,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:41,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:43,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:44,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select c_B 0) 0)) (.cse0 (select c_F 0)) (.cse2 (select c_A 0)) (.cse3 (select (select c_B 1) 0)) (.cse4 (select c_A 1))) (and (= .cse0 .cse1) (= c_j 1) (= .cse1 .cse2) (or (= .cse3 .cse2) (not (= c_M 0))) (= .cse0 .cse2) (= c_i 1) (forall ((b Int) (a Int)) (or (< c_i (+ a 1)) (= (select c_A (+ b (* a c_M))) (select (select c_B a) b)) (< c_M (+ b 1)) (< a 0) (< b 0))) (= .cse4 (select c_F 1)) (or (not (= c_M 1)) (= .cse3 .cse4)))) is different from false [2025-01-30 00:16:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:45,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-30 00:16:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:45,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:16:45,364 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:16:45,364 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #2 [2025-01-30 00:16:45,364 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:16:45,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:16:45,364 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:45,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:16:45,364 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:45,364 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-01-30 00:16:45,365 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:45,365 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-01-30 00:16:45,365 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:45,365 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:16:45,365 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:16:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:16:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2076745755, now seen corresponding path program 4 times [2025-01-30 00:16:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:16:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079563524] [2025-01-30 00:16:45,366 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:16:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:16:45,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-30 00:16:45,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-30 00:16:45,389 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-30 00:16:45,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:16:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746029277] [2025-01-30 00:16:45,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:16:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:16:45,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:16:45,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-30 00:16:45,419 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-30 00:16:45,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-30 00:16:45,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-30 00:16:45,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:16:45,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-30 00:16:45,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:16:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-30 00:16:45,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:16:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-30 00:16:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:16:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079563524] [2025-01-30 00:16:46,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:16:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746029277] [2025-01-30 00:16:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746029277] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:16:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:16:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-01-30 00:16:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658545952] [2025-01-30 00:16:46,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:16:46,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-30 00:16:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:16:46,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-30 00:16:46,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-30 00:16:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:46,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:16:46,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:46,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:49,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:16:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:16:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-30 00:16:50,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:50,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:16:50,252 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:16:50,252 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #3 [2025-01-30 00:16:50,252 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:16:50,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:16:50,252 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:16:50,252 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-01-30 00:16:50,252 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-01-30 00:16:50,252 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,253 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-01-30 00:16:50,253 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,253 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-30 00:16:50,253 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,253 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-30 00:16:50,253 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,253 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:16:50,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:16:50,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:16:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 138887267, now seen corresponding path program 5 times [2025-01-30 00:16:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:16:50,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901952590] [2025-01-30 00:16:50,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:16:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:16:50,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-01-30 00:16:50,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-01-30 00:16:50,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-30 00:16:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:16:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:16:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:16:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901952590] [2025-01-30 00:16:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901952590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:16:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615501935] [2025-01-30 00:16:50,340 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:16:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:50,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:16:50,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:16:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-30 00:16:50,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-01-30 00:16:50,373 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-01-30 00:16:50,373 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-30 00:16:50,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:16:50,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-30 00:16:50,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:16:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:16:50,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:16:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:16:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615501935] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:16:50,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 00:16:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-30 00:16:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737426035] [2025-01-30 00:16:50,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 00:16:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-30 00:16:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:16:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-30 00:16:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-30 00:16:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:50,430 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:16:50,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:16:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:16:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:16:50,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-30 00:16:50,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:50,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:16:50,769 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:16:50,769 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #4 [2025-01-30 00:16:50,769 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:16:50,769 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:16:50,769 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-01-30 00:16:50,769 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-30 00:16:50,769 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-01-30 00:16:50,769 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-30 00:16:50,769 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,769 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-30 00:16:50,770 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:16:50,770 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-01-30 00:16:50,770 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:16:50,770 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:16:50,770 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:16:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:16:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -80721656, now seen corresponding path program 6 times [2025-01-30 00:16:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:16:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543323440] [2025-01-30 00:16:50,770 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:16:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:16:50,778 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-01-30 00:16:50,797 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-30 00:16:50,797 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-30 00:16:50,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:16:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631846937] [2025-01-30 00:16:50,798 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:16:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:16:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:16:50,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:16:50,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-30 00:16:50,833 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-01-30 00:16:50,847 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-01-30 00:16:50,847 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-30 00:16:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:16:50,848 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-30 00:16:50,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:16:50,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:16:50,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-01-30 00:16:50,908 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 13 treesize of output 9 [2025-01-30 00:16:50,979 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 22 [2025-01-30 00:16:50,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 33 treesize of output 25 [2025-01-30 00:16:51,073 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 27 treesize of output 20 [2025-01-30 00:16:51,108 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 27 treesize of output 20 [2025-01-30 00:16:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:16:51,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:16:53,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:16:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2025-01-30 00:16:53,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:16:53,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 79 [2025-01-30 00:16:53,251 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 17 treesize of output 15 [2025-01-30 00:16:55,376 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-30 00:16:55,376 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 18 treesize of output 18 [2025-01-30 00:16:55,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:16:55,386 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:16:55,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:16:55,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-01-30 00:16:55,396 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 47 treesize of output 41 [2025-01-30 00:16:55,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:16:55,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-01-30 00:16:55,412 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:16:55,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:16:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:16:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:16:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543323440] [2025-01-30 00:16:55,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:16:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631846937] [2025-01-30 00:16:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631846937] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:16:55,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:16:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2025-01-30 00:16:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434117279] [2025-01-30 00:16:55,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:16:55,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-30 00:16:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:16:55,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-30 00:16:55,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=715, Unknown=4, NotChecked=0, Total=870 [2025-01-30 00:16:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:55,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:16:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:16:55,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:16:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:16:59,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:10,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:13,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:15,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:26,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:30,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:33,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:40,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:42,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:48,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:50,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:17:57,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:18:13,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:18:27,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:18:28,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:19:33,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:19:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:19:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-30 00:19:35,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-30 00:19:35,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:19:35,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:19:35,938 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:19:35,938 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #5 [2025-01-30 00:19:35,938 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:19:35,938 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:19:35,938 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:35,938 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:19:35,938 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:35,938 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-30 00:19:35,938 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:35,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-30 00:19:35,939 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:35,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-30 00:19:35,939 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:35,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-30 00:19:35,939 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:35,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-01-30 00:19:35,939 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:35,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-01-30 00:19:35,939 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:35,939 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:19:35,939 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:19:35,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:19:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2121826196, now seen corresponding path program 7 times [2025-01-30 00:19:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:19:35,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543095404] [2025-01-30 00:19:35,940 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 00:19:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:19:35,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-30 00:19:35,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-30 00:19:35,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:19:35,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:19:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686204600] [2025-01-30 00:19:35,975 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 00:19:35,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:19:35,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:19:35,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:19:35,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-30 00:19:36,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-30 00:19:36,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-30 00:19:36,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:19:36,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:19:36,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-30 00:19:36,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:19:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-30 00:19:36,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:19:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-30 00:19:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:19:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543095404] [2025-01-30 00:19:36,529 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:19:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686204600] [2025-01-30 00:19:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686204600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:19:36,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:19:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-01-30 00:19:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194505915] [2025-01-30 00:19:36,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:19:36,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-30 00:19:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:19:36,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-30 00:19:36,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-01-30 00:19:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:19:36,531 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:19:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2025-01-30 00:19:36,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:19:46,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:19:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:19:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-30 00:19:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-30 00:19:46,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-30 00:19:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:19:46,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:19:46,664 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:19:46,664 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #6 [2025-01-30 00:19:46,664 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:19:46,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:19:46,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-30 00:19:46,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-01-30 00:19:46,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-30 00:19:46,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:19:46,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-30 00:19:46,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:19:46,664 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:19:46,664 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:19:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:19:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1177366474, now seen corresponding path program 8 times [2025-01-30 00:19:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:19:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457486283] [2025-01-30 00:19:46,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:19:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:19:46,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-30 00:19:46,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:19:46,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:19:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:19:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007840623] [2025-01-30 00:19:46,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:19:46,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:19:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:19:46,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:19:46,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-30 00:19:46,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-30 00:19:46,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:19:46,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:19:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:19:46,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-30 00:19:46,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:19:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-30 00:19:46,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:19:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-30 00:19:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:19:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457486283] [2025-01-30 00:19:47,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:19:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007840623] [2025-01-30 00:19:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007840623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:19:47,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:19:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-01-30 00:19:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568944790] [2025-01-30 00:19:47,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:19:47,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-30 00:19:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:19:47,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-30 00:19:47,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-01-30 00:19:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:19:47,154 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:19:47,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-30 00:19:47,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:47,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:19:47,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:19:47,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-01-30 00:19:47,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:19:47,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_i 1) c_N))) (and (forall ((M Int)) (or (< (+ 2 c_x) (+ M (* c_i M))) (< M 3))) (or (forall ((M Int)) (or (< c_x (* c_N M)) (< M (+ 2 c_j)))) .cse0) (or (forall ((M Int)) (or (< M (+ 3 c_j)) (< (+ c_x 1) (* c_N M)))) .cse0) (<= c_x 0))) is different from false [2025-01-30 00:19:53,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:19:55,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:04,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:05,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:12,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:17,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:26,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_i 1) c_N)) (.cse1 (+ c_x 1))) (and (or (forall ((M Int)) (or (< c_x (* c_N M)) (< M (+ 2 c_j)))) .cse0) (or (< c_L (* c_N c_M)) (< c_i c_N)) (or (forall ((M Int)) (or (< M (+ 3 c_j)) (< .cse1 (* c_N M)))) .cse0) (forall ((M Int)) (or (< M 3) (< .cse1 (+ M (* c_i M))))))) is different from false [2025-01-30 00:20:32,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:45,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:46,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:48,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:49,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:20:57,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:10,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:12,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:14,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:16,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:21:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:21:17,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-30 00:21:18,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:21:18,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:21:18,141 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:21:18,141 INFO L139 ounterexampleChecker]: Examining path program with hash 1658234101, occurence #1 [2025-01-30 00:21:18,141 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:21:18,141 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:21:18,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:21:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 581976207, now seen corresponding path program 9 times [2025-01-30 00:21:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:21:18,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910717462] [2025-01-30 00:21:18,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:21:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:21:18,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-01-30 00:21:18,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-01-30 00:21:18,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-30 00:21:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:21:18,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895351596] [2025-01-30 00:21:18,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:21:18,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:21:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:21:18,162 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:21:18,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-30 00:21:18,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-01-30 00:21:18,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-01-30 00:21:18,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-30 00:21:18,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:21:18,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-30 00:21:18,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:21:18,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:21:18,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-01-30 00:21:18,284 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 13 treesize of output 9 [2025-01-30 00:21:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 28 [2025-01-30 00:21:18,493 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 22 [2025-01-30 00:21:18,626 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 0 case distinctions, treesize of input 32 treesize of output 34 [2025-01-30 00:21:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-01-30 00:21:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:21:18,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:21:19,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 68 [2025-01-30 00:21:19,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 67 [2025-01-30 00:21:19,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 80 [2025-01-30 00:21:19,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-01-30 00:21:19,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-30 00:21:19,510 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 10 treesize of output 8 [2025-01-30 00:21:19,516 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 10 treesize of output 8 [2025-01-30 00:21:19,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:21:19,529 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 50 treesize of output 52 [2025-01-30 00:21:20,387 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,393 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-30 00:21:20,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2025-01-30 00:21:20,400 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,401 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-01-30 00:21:20,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,414 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2025-01-30 00:21:20,418 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,422 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,424 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 37 [2025-01-30 00:21:20,429 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 186 treesize of output 178 [2025-01-30 00:21:20,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,443 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:21:20,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2025-01-30 00:21:20,447 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:21:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 99 treesize of output 95 [2025-01-30 00:21:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:21:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:21:20,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910717462] [2025-01-30 00:21:20,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:21:20,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895351596] [2025-01-30 00:21:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895351596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:21:20,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:21:20,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2025-01-30 00:21:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547300422] [2025-01-30 00:21:20,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:21:20,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-30 00:21:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:21:20,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-30 00:21:20,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2025-01-30 00:21:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:21:20,523 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:21:20,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 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-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:21:20,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:21:20,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:21:24,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:26,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:33,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:36,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:21:58,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:00,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:02,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:05,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:10,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:12,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:17,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:20,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:30,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:22:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-30 00:22:35,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-30 00:22:35,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-30 00:22:35,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:22:35,383 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:22:35,383 INFO L139 ounterexampleChecker]: Examining path program with hash 1658234101, occurence #2 [2025-01-30 00:22:35,383 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:22:35,384 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:22:35,384 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-01-30 00:22:35,384 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:22:35,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-01-30 00:22:35,384 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:22:35,384 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:22:35,384 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:22:35,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:22:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2100061534, now seen corresponding path program 10 times [2025-01-30 00:22:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:22:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993074982] [2025-01-30 00:22:35,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:22:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:22:35,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-30 00:22:35,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:22:35,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-30 00:22:35,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:22:35,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085817092] [2025-01-30 00:22:35,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:22:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:22:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:22:35,418 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:22:35,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-30 00:22:35,452 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-30 00:22:35,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:22:35,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-30 00:22:35,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:22:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-30 00:22:35,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:22:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-30 00:22:35,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:22:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-30 00:22:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:22:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993074982] [2025-01-30 00:22:37,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:22:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085817092] [2025-01-30 00:22:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085817092] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:22:37,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:22:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-01-30 00:22:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789363141] [2025-01-30 00:22:37,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:22:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-30 00:22:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:22:37,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-30 00:22:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-01-30 00:22:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:22:37,114 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:22:37,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2025-01-30 00:22:37,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:22:39,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:10,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:13,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:16,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-30 00:23:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-30 00:23:17,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-30 00:23:17,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:23:17,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:23:17,497 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:23:17,497 INFO L139 ounterexampleChecker]: Examining path program with hash -1670984995, occurence #1 [2025-01-30 00:23:17,497 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:23:17,497 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:23:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:23:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 599417903, now seen corresponding path program 11 times [2025-01-30 00:23:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:23:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879965519] [2025-01-30 00:23:17,498 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:23:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:23:17,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-01-30 00:23:17,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:23:17,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-30 00:23:17,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:23:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343164299] [2025-01-30 00:23:17,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:23:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:23:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:23:17,517 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:23:17,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-30 00:23:17,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-01-30 00:23:17,562 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-01-30 00:23:17,562 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-30 00:23:17,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:23:17,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-30 00:23:17,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:23:17,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:23:17,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:23:17,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2025-01-30 00:23:17,627 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 13 treesize of output 9 [2025-01-30 00:23:17,629 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 17 treesize of output 13 [2025-01-30 00:23:17,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:23:17,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-30 00:23:17,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:23:17,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-30 00:23:17,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:23:17,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-30 00:23:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:23:17,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:23:22,247 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 70 treesize of output 66 [2025-01-30 00:23:26,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:23:26,642 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 50 treesize of output 55 [2025-01-30 00:23:26,654 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 53519 treesize of output 53263 [2025-01-30 00:23:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:23:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:23:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879965519] [2025-01-30 00:23:26,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:23:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343164299] [2025-01-30 00:23:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343164299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:23:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:23:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-01-30 00:23:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007844136] [2025-01-30 00:23:26,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:23:26,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-30 00:23:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:23:26,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-30 00:23:26,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=407, Unknown=4, NotChecked=0, Total=506 [2025-01-30 00:23:26,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:23:26,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:23:26,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-01-30 00:23:26,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:23:30,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:33,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:35,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:37,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:39,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:44,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:55,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:57,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:23:59,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:10,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:23,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:24,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:36,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:38,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:40,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:42,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:44,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:46,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:48,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:50,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:52,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:54,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:56,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:24:59,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:01,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:03,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:05,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:07,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:09,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:11,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:13,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:15,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:21,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:23,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:25,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:27,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:29,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:42,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:44,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:46,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:48,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:25:50,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:05,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:07,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:09,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:11,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:14,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:17,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:19,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:26:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:26:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-30 00:26:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:26:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-30 00:26:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-30 00:26:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-30 00:26:20,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-30 00:26:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:26:20,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:26:20,671 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:26:20,671 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #7 [2025-01-30 00:26:20,671 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-30 00:26:20,671 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-30 00:26:20,671 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-01-30 00:26:20,671 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:26:20,671 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-01-30 00:26:20,671 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:26:20,671 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:26:20,671 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:26:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:26:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -740959916, now seen corresponding path program 12 times [2025-01-30 00:26:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:26:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905542293] [2025-01-30 00:26:20,672 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:26:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:26:20,676 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 5 equivalence classes. [2025-01-30 00:26:20,695 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 28 of 28 statements. [2025-01-30 00:26:20,696 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-30 00:26:20,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-30 00:26:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383677805] [2025-01-30 00:26:20,697 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:26:20,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:26:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:26:20,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:26:20,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-30 00:26:20,735 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 5 equivalence classes. [2025-01-30 00:26:20,829 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 28 of 28 statements. [2025-01-30 00:26:20,829 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-30 00:26:20,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:26:20,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-30 00:26:20,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:26:20,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-01-30 00:26:20,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-01-30 00:26:20,914 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 13 treesize of output 9 [2025-01-30 00:26:20,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 28 [2025-01-30 00:26:21,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2025-01-30 00:26:21,195 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 22 [2025-01-30 00:26:21,366 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 0 case distinctions, treesize of input 34 treesize of output 36 [2025-01-30 00:26:21,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:26:21,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:26:21,717 INFO L349 Elim1Store]: treesize reduction 32, result has 71.2 percent of original size [2025-01-30 00:26:21,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 78 treesize of output 133 [2025-01-30 00:26:21,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 115 [2025-01-30 00:26:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:26:23,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:26:59,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 111 [2025-01-30 00:26:59,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 110 [2025-01-30 00:26:59,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 109 [2025-01-30 00:26:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:26:59,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 137 [2025-01-30 00:26:59,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-01-30 00:26:59,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-01-30 00:26:59,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-30 00:26:59,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-01-30 00:26:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-01-30 00:26:59,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-01-30 00:26:59,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:26:59,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:26:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 85 [2025-01-30 00:27:38,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,458 INFO L349 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-01-30 00:27:38,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2025-01-30 00:27:38,485 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,487 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,609 INFO L349 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2025-01-30 00:27:38,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2025-01-30 00:27:38,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,629 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,632 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,637 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,639 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,641 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,644 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,803 INFO L349 Elim1Store]: treesize reduction 32, result has 66.7 percent of original size [2025-01-30 00:27:38,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 122 [2025-01-30 00:27:38,842 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,876 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:38,903 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 84 treesize of output 78 [2025-01-30 00:27:39,091 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,112 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,115 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,128 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2025-01-30 00:27:39,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 1 [2025-01-30 00:27:39,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,141 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,143 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,153 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,165 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,174 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,184 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,310 INFO L349 Elim1Store]: treesize reduction 38, result has 58.7 percent of original size [2025-01-30 00:27:39,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 112 [2025-01-30 00:27:39,339 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,347 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,376 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 84 treesize of output 78 [2025-01-30 00:27:39,516 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,520 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,525 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,532 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,535 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,538 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,685 INFO L349 Elim1Store]: treesize reduction 21, result has 58.0 percent of original size [2025-01-30 00:27:39,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 83 [2025-01-30 00:27:39,699 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,721 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,730 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 34 treesize of output 28 [2025-01-30 00:27:39,863 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,869 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2025-01-30 00:27:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,888 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,889 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,891 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,892 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,898 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,901 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 36 [2025-01-30 00:27:39,925 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,929 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 68 treesize of output 62 [2025-01-30 00:27:39,946 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-01-30 00:27:39,954 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,964 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,966 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,971 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,975 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,977 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:39,991 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:39,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 59 [2025-01-30 00:27:40,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,013 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 608 treesize of output 584 [2025-01-30 00:27:40,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,042 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,052 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,054 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,059 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 55 [2025-01-30 00:27:40,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,081 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,091 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 147 treesize of output 135 [2025-01-30 00:27:40,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2025-01-30 00:27:40,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,160 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,165 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 47 treesize of output 41 [2025-01-30 00:27:40,192 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2025-01-30 00:27:40,212 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,244 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,247 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,252 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,256 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,257 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,268 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,272 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,274 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,289 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,294 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 63 [2025-01-30 00:27:40,337 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 1016 treesize of output 992 [2025-01-30 00:27:40,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,378 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,380 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,387 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-01-30 00:27:40,404 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,421 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 51 treesize of output 45 [2025-01-30 00:27:40,448 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,450 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,455 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:27:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 55 [2025-01-30 00:27:40,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,482 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:27:40,493 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 155 treesize of output 143 [2025-01-30 00:27:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:27:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:27:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905542293] [2025-01-30 00:27:41,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-30 00:27:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383677805] [2025-01-30 00:27:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383677805] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:27:41,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:27:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2025-01-30 00:27:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475071142] [2025-01-30 00:27:41,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-30 00:27:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-30 00:27:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:27:41,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-30 00:27:41,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1312, Unknown=22, NotChecked=0, Total=1560 [2025-01-30 00:27:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:27:41,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:27:41,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2025-01-30 00:27:41,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:27:45,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:27:47,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:27:49,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:27:51,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:27:52,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:27:54,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:28:01,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:28:03,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-01-30 00:28:05,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:28:07,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-01-30 00:28:14,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:28:16,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-30 00:28:18,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] Received shutdown request... [2025-01-30 00:28:25,030 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 00:28:25,031 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 00:28:25,031 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 00:28:26,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-30 00:28:26,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-30 00:28:26,231 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2025-01-30 00:28:26,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2025-01-30 00:28:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-30 00:28:26,425 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-01-30 00:28:26,427 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-01-30 00:28:26,427 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-30 00:28:26,427 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-30 00:28:26,432 INFO L422 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1] [2025-01-30 00:28:26,434 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-30 00:28:26,434 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-30 00:28:26,437 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:28:26 BasicIcfg [2025-01-30 00:28:26,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-30 00:28:26,437 INFO L158 Benchmark]: Toolchain (without parser) took 869158.87ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 97.2MB in the beginning and 161.8MB in the end (delta: -64.6MB). Peak memory consumption was 95.3MB. Max. memory is 16.0GB. [2025-01-30 00:28:26,438 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:28:26,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.07ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 96.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:28:26,438 INFO L158 Benchmark]: Boogie Preprocessor took 19.18ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:28:26,438 INFO L158 Benchmark]: RCFGBuilder took 249.19ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 85.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-30 00:28:26,439 INFO L158 Benchmark]: TraceAbstraction took 868859.80ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 85.3MB in the beginning and 161.8MB in the end (delta: -76.5MB). Peak memory consumption was 86.9MB. Max. memory is 16.0GB. [2025-01-30 00:28:26,441 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 25.07ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 96.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 19.18ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 249.19ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 85.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 868859.80ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 85.3MB in the beginning and 161.8MB in the end (delta: -76.5MB). Peak memory consumption was 86.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3648, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 2383, dependent conditional: 2383, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1265, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1121, Maximal queried relation: 0, Independence queries for same thread: 2383, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 25, Number of trivial persistent sets: 15, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3648, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 2383, dependent conditional: 2383, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 1121, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1265, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1265, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1121, Maximal queried relation: 0, Independence queries for same thread: 2383 - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 29 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 868.7s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 737.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 500, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 127.1s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 576 ConstructedInterpolants, 175 QuantifiedInterpolants, 21539 SizeOfPredicates, 170 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 62/297 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 23, ConditionCalculationTime [ms]: 0, ConditionCalculations: 45, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown