/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 -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-22 22:49:37,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-22 22:49:37,404 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-22 22:49:37,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-22 22:49:37,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-22 22:49:37,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-22 22:49:37,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-22 22:49:37,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-22 22:49:37,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-22 22:49:37,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-22 22:49:37,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-22 22:49:37,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-22 22:49:37,461 INFO L153 SettingsManager]: * Use SBE=true [2025-01-22 22:49:37,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-22 22:49:37,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-22 22:49:37,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-22 22:49:37,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 22:49:37,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-22 22:49:37,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-22 22:49:37,465 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-22 22:49:37,465 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 [2025-01-22 22:49:37,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-22 22:49:37,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-22 22:49:37,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-22 22:49:37,726 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-22 22:49:37,726 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-22 22:49:37,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2025-01-22 22:49:37,730 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2025-01-22 22:49:37,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-22 22:49:37,757 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-22 22:49:37,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-22 22:49:37,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-22 22:49:37,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-22 22:49:37,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,781 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-22 22:49:37,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-22 22:49:37,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-22 22:49:37,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-22 22:49:37,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-22 22:49:37,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-22 22:49:37,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-22 22:49:37,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-22 22:49:37,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-22 22:49:37,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/1) ... [2025-01-22 22:49:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 22:49:37,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:49:37,831 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-22 22:49:37,840 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-22 22:49:37,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-22 22:49:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-22 22:49:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-22 22:49:37,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-22 22:49:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-22 22:49:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-22 22:49:37,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-22 22:49:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-22 22:49:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-22 22:49:37,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-22 22:49:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-22 22:49:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-22 22:49:37,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-22 22:49:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-22 22:49:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-22 22:49:37,865 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-22 22:49:37,921 INFO L234 CfgBuilder]: Building ICFG [2025-01-22 22:49:37,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-22 22:49:38,048 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-22 22:49:38,049 INFO L283 CfgBuilder]: Performing block encoding [2025-01-22 22:49:38,092 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-22 22:49:38,092 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-22 22:49:38,093 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 10:49:38 BoogieIcfgContainer [2025-01-22 22:49:38,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-22 22:49:38,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-22 22:49:38,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-22 22:49:38,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-22 22:49:38,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 10:49:37" (1/2) ... [2025-01-22 22:49:38,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406d737f and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.01 10:49:38, skipping insertion in model container [2025-01-22 22:49:38,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 10:49:38" (2/2) ... [2025-01-22 22:49:38,101 INFO L128 eAbstractionObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-01-22 22:49:38,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-22 22:49:38,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prod-cons3.wvr.bpl that has 5 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-22 22:49:38,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-22 22:49:38,165 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-22 22:49:38,208 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 22:49:38,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-22 22:49:38,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:49:38,213 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-22 22:49:38,215 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-22 22:49:38,286 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-22 22:49:38,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-22 22:49:38,315 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;@48cb988b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 22:49:38,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-22 22:49:38,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:49:38,815 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:49:38,816 INFO L139 ounterexampleChecker]: Examining path program with hash -2034200965, occurence #1 [2025-01-22 22:49:38,816 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:49:38,816 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:49:38,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2087246828, now seen corresponding path program 1 times [2025-01-22 22:49:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:49:38,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041235443] [2025-01-22 22:49:38,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 22:49:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-22 22:49:38,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-22 22:49:38,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 22:49:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:39,002 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-22 22:49:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:49:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041235443] [2025-01-22 22:49:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041235443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 22:49:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 22:49:39,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 22:49:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509302441] [2025-01-22 22:49:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 22:49:39,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-22 22:49:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:49:39,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-22 22:49:39,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-22 22:49:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:39,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:49:39,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 22:49:39,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-22 22:49:39,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:49:39,233 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:49:39,233 INFO L139 ounterexampleChecker]: Examining path program with hash 146038111, occurence #1 [2025-01-22 22:49:39,233 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:49:39,233 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:49:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -571498906, now seen corresponding path program 1 times [2025-01-22 22:49:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:49:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192689843] [2025-01-22 22:49:39,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 22:49:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:39,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-22 22:49:39,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-22 22:49:39,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 22:49:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:39,349 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-22 22:49:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:49:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192689843] [2025-01-22 22:49:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192689843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 22:49:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 22:49:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 22:49:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157823849] [2025-01-22 22:49:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 22:49:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-22 22:49:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:49:39,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-22 22:49:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-22 22:49:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:39,352 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:49:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-22 22:49:39,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:39,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:49:39,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-22 22:49:39,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:49:39,627 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:49:39,627 INFO L139 ounterexampleChecker]: Examining path program with hash 1179964389, occurence #1 [2025-01-22 22:49:39,627 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:49:39,627 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:49:39,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1472607756, now seen corresponding path program 2 times [2025-01-22 22:49:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:49:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771513669] [2025-01-22 22:49:39,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 22:49:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:39,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 22:49:39,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 22:49:39,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 22:49:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:40,058 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-22 22:49:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:49:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771513669] [2025-01-22 22:49:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771513669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:49:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573786450] [2025-01-22 22:49:40,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 22:49:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:49:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:49:40,083 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-22 22:49:40,086 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-22 22:49:40,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 22:49:40,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 22:49:40,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 22:49:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:40,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-22 22:49:40,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:49:40,334 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 11 treesize of output 7 [2025-01-22 22:49:40,407 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 11 treesize of output 7 [2025-01-22 22:49:40,483 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-22 22:49:40,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 22:49:40,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:40,546 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 19 treesize of output 23 [2025-01-22 22:49:40,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:40,641 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 20 treesize of output 24 [2025-01-22 22:49:40,756 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-22 22:49:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573786450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 22:49:40,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 22:49:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-01-22 22:49:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565156126] [2025-01-22 22:49:40,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 22:49:40,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-22 22:49:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:49:40,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-22 22:49:40,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-22 22:49:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:40,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:49:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 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-22 22:49:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:49:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:49:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:49:41,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-22 22:49:42,119 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-22 22:49:42,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:49:42,119 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:49:42,119 INFO L139 ounterexampleChecker]: Examining path program with hash 135271114, occurence #1 [2025-01-22 22:49:42,119 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:49:42,119 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:49:42,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1876424242, now seen corresponding path program 3 times [2025-01-22 22:49:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:49:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36632730] [2025-01-22 22:49:42,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 22:49:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:42,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 22:49:42,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 22:49:42,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 22:49:42,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:49:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:49:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36632730] [2025-01-22 22:49:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36632730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:49:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967266515] [2025-01-22 22:49:42,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 22:49:42,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:49:42,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:49:42,815 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-22 22:49:42,817 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-22 22:49:42,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 22:49:42,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 22:49:42,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 22:49:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:42,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-22 22:49:42,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:49:43,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 22:49:43,501 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:49:43,502 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 27 treesize of output 19 [2025-01-22 22:49:43,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:43,653 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 25 treesize of output 13 [2025-01-22 22:49:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:49:43,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 22:49:44,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:49:44,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:44,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 59 [2025-01-22 22:49:44,678 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-01-22 22:49:44,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 80 [2025-01-22 22:49:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:49:45,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967266515] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 22:49:45,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 22:49:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2025-01-22 22:49:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524952845] [2025-01-22 22:49:45,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 22:49:45,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-22 22:49:45,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:49:45,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-22 22:49:45,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2025-01-22 22:49:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:45,081 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:49:45,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 22:49:45,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:45,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:49:45,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:49:45,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:49:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:49:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:49:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:49:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 22:49:53,018 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-22 22:49:53,213 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-22 22:49:53,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:49:53,213 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:49:53,213 INFO L139 ounterexampleChecker]: Examining path program with hash 135271114, occurence #2 [2025-01-22 22:49:53,213 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-22 22:49:53,214 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-01-22 22:49:53,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 728053896, now seen corresponding path program 1 times [2025-01-22 22:49:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-22 22:49:53,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874008564] [2025-01-22 22:49:53,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 22:49:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:53,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-22 22:49:53,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-22 22:49:53,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 22:49:53,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-22 22:49:54,333 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-01-22 22:49:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874008564] [2025-01-22 22:49:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874008564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:49:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [816153671] [2025-01-22 22:49:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 22:49:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:54,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-22 22:49:54,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-22 22:49:54,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 22:49:54,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:54,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-22 22:49:54,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:49:55,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:55,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 43 [2025-01-22 22:49:55,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:55,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 22 [2025-01-22 22:49:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:49:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [816153671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:49:55,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-22 22:49:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 44 [2025-01-22 22:49:55,804 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-01-22 22:49:55,804 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-01-22 22:49:55,804 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-22 22:49:55,804 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-01-22 22:49:55,804 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-22 22:49:55,804 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-22 22:49:55,804 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:49:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:49:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 51539966, now seen corresponding path program 4 times [2025-01-22 22:49:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:49:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040863526] [2025-01-22 22:49:55,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 22:49:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:49:55,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 22:49:55,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-22 22:49:55,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 22:49:55,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-22 22:49:56,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:49:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040863526] [2025-01-22 22:49:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040863526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:49:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491651615] [2025-01-22 22:49:56,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 22:49:56,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:49:56,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:49:56,755 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-22 22:49:56,757 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-22 22:49:56,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 22:49:56,804 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-22 22:49:56,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 22:49:56,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:49:56,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-22 22:49:56,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:49:58,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:58,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 43 [2025-01-22 22:49:58,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 22 [2025-01-22 22:49:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:49:58,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 22:49:59,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:49:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 195 [2025-01-22 22:50:01,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:50:01,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56 treesize of output 180 [2025-01-22 22:50:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:50:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491651615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 22:50:02,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 22:50:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 68 [2025-01-22 22:50:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332522653] [2025-01-22 22:50:02,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 22:50:02,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-01-22 22:50:02,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:50:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-01-22 22:50:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2025-01-22 22:50:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:50:02,862 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:50:02,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 68 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 22:50:02,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:50:02,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:50:02,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:50:02,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 22:50:02,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:50:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:50:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:50:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:50:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 22:50:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 22:50:27,608 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-22 22:50:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:50:27,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:50:27,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:50:27,804 INFO L139 ounterexampleChecker]: Examining path program with hash -469148396, occurence #1 [2025-01-22 22:50:27,805 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:50:27,805 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:50:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:50:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -524246657, now seen corresponding path program 5 times [2025-01-22 22:50:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:50:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616281818] [2025-01-22 22:50:27,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 22:50:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:50:27,812 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 22:50:27,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 22:50:27,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 22:50:27,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:50:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 11 proven. 229 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-22 22:50:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:50:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616281818] [2025-01-22 22:50:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616281818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:50:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767918098] [2025-01-22 22:50:30,695 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 22:50:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:50:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:50:30,696 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-22 22:50:30,697 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-22 22:50:30,728 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 22:50:30,774 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 22:50:30,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 22:50:30,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:50:30,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-22 22:50:30,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:50:37,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:50:37,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 145 treesize of output 85 [2025-01-22 22:50:38,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:50:38,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 42 [2025-01-22 22:50:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:50:38,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 22:50:48,556 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,558 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,560 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,560 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,561 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,565 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,566 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,567 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,567 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,569 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,569 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,571 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,572 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,573 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,573 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,573 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,578 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,578 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,583 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,585 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,587 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,594 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,595 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:50:48,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:50:48,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 100 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 53 case distinctions, treesize of input 159 treesize of output 619 [2025-01-22 22:52:21,530 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:21,622 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:21,751 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:22,073 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:22,181 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:22,283 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:22,331 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:22,374 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 22:52:22,410 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:22,550 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:22,650 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:22,695 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:22,751 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:22,860 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:23,080 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:23,201 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:23,310 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:23,530 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:23,761 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:23,869 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:24,089 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:24,582 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:24,813 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:24,866 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:24,965 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:25,183 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:25,433 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:25,975 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:26,196 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:26,419 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:26,914 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:27,132 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:27,363 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:27,873 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:52:30,402 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:30,907 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:31,406 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:31,907 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:32,400 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:52:34,931 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:35,435 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:36,555 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:37,056 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:37,550 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:38,673 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:39,169 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:39,289 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:39,520 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:39,614 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:39,843 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:40,966 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:41,469 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:41,692 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:42,191 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:43,538 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:43,753 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:44,256 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:44,471 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:44,967 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:46,085 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:46,589 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:47,711 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:48,210 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:49,327 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:52:51,861 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:52,980 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:53,477 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:53,975 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:54,213 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:54,315 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:54,540 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:54,754 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:55,277 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:55,370 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:55,865 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:56,082 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:56,305 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:52:57,427 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:57,641 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:58,138 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:58,651 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:58,756 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:58,809 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:58,902 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:59,124 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:52:59,621 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:52:59,845 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:52:59,941 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:52:59,985 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:00,081 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:00,336 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:00,554 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:00,656 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:00,752 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:00,971 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:01,468 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:01,704 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:01,919 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:02,416 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:02,649 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:02,761 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:02,864 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:02,920 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:03,012 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:03,238 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:03,729 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:04,852 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:05,345 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:05,592 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:05,635 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 22:53:05,659 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:05,756 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:05,799 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:06,019 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:06,124 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:06,170 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 22:53:06,195 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:06,291 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:06,343 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:06,563 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:06,777 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:07,275 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:07,380 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:07,594 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:07,698 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:07,742 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:07,887 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:08,380 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:09,502 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:09,739 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:10,854 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:11,352 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:11,847 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:12,072 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:12,568 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:15,094 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:15,312 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:15,422 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:15,920 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:16,148 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:17,276 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:17,502 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:17,999 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:18,105 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:18,367 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:18,465 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:18,691 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:18,744 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:18,961 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:19,498 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:20,611 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:21,108 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:21,214 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:21,749 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 22:53:21,788 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:21,887 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:22,109 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:22,155 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:22,258 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:22,477 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:22,693 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:23,192 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:53:23,274 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:23,369 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:23,602 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:23,708 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:23,923 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:53:24,044 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:24,545 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:25,653 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:26,145 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:27,258 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:29,774 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:30,902 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:32,014 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:34,522 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:35,662 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:36,153 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:37,292 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:53:37,838 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:38,956 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:41,464 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:53:42,580 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:45,091 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:45,308 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:53:45,560 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 22:53:51,207 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:53:53,725 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 22:53:59,404 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:54:01,921 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:02,418 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:02,929 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:03,031 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:03,267 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:03,762 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:03,868 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:04,993 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:05,504 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:05,731 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:05,784 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:05,892 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:06,152 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:06,665 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:06,894 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:07,129 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:08,272 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:08,774 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:09,318 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:09,423 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:09,480 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:09,713 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:10,222 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:10,453 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:11,589 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:12,087 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:13,221 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:13,447 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:14,591 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:15,721 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:16,841 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:17,978 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:19,108 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:54:21,629 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:22,756 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:23,879 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:24,414 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:24,529 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:24,770 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:25,272 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:26,408 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:26,909 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:27,135 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:27,667 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:28,167 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:29,297 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:54:31,824 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:32,958 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:34,090 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:34,589 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:35,711 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:36,208 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:36,537 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:37,032 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:38,155 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:38,373 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:38,494 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:38,730 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:38,971 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:39,077 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:39,193 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:39,447 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:39,500 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:39,557 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:39,614 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:39,692 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 22:54:39,743 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:39,849 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:39,950 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:40,446 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:40,670 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:40,765 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:41,278 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:41,500 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:41,718 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:41,935 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:42,497 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:42,729 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:43,237 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:43,746 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:44,868 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:54:47,384 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:48,533 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:49,665 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:50,170 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:50,661 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:51,779 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:52,282 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:52,504 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:53,026 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:53,248 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:53,740 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:53,964 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:54:54,062 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:54,290 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:54:54,511 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:55,058 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:55,576 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:54:56,082 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:57,208 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:58,346 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:54:59,484 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:55:02,009 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:55:04,531 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:55:05,699 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:55:08,222 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 22:55:10,747 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:55:11,875 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:55:13,000 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:55:14,132 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:55:14,635 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:55:15,150 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:55:15,365 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 22:55:16,490 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:55:16,986 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:55:17,097 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:55:17,319 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 22:55:17,420 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 22:55:17,916 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 22:55:19,433 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,434 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,435 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,436 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,436 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,443 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,443 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,449 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,452 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,455 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,460 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,462 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,464 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,464 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,465 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,465 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,466 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,466 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,467 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,470 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,471 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,478 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:55:19,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:55:19,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 108 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 123 treesize of output 487 [2025-01-22 22:55:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 1 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:55:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767918098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 22:55:24,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 22:55:24,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 58, 58] total 139 [2025-01-22 22:55:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192845629] [2025-01-22 22:55:24,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 22:55:24,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2025-01-22 22:55:24,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 22:55:24,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2025-01-22 22:55:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1864, Invalid=17596, Unknown=0, NotChecked=0, Total=19460 [2025-01-22 22:55:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:55:24,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 22:55:24,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 140 states have (on average 1.8928571428571428) internal successors, (265), 139 states have internal predecessors, (265), 0 states have call successors, (0), 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-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2025-01-22 22:55:24,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 22:58:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 22:58:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 22:58:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 22:58:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 22:58:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 22:58:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2025-01-22 22:58:16,566 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-22 22:58:16,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:58:16,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 22:58:16,761 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 22:58:16,761 INFO L139 ounterexampleChecker]: Examining path program with hash 945091936, occurence #1 [2025-01-22 22:58:16,761 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 22:58:16,761 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 22:58:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 22:58:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2044072488, now seen corresponding path program 6 times [2025-01-22 22:58:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 22:58:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459044966] [2025-01-22 22:58:16,761 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 22:58:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 22:58:16,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 22:58:16,863 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 22:58:16,864 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 22:58:16,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:58:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 463 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-22 22:58:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 22:58:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459044966] [2025-01-22 22:58:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459044966] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 22:58:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833483834] [2025-01-22 22:58:20,867 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 22:58:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 22:58:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 22:58:20,869 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-22 22:58:20,869 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-22 22:58:20,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 22:58:20,943 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 22:58:20,943 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 22:58:20,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 22:58:20,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-01-22 22:58:20,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 22:58:32,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:58:32,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 209 treesize of output 125 [2025-01-22 22:58:34,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:58:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 134 treesize of output 50 [2025-01-22 22:58:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 22:58:34,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 22:58:51,794 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,798 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,800 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,805 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,810 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,811 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,811 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,813 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,813 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,813 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,816 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,818 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,819 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,819 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,819 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,823 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,824 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,824 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,828 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,834 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,836 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,839 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,840 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,840 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,842 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:51,851 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 22:58:52,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:58:52,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 165 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 197 treesize of output 751 [2025-01-22 22:59:25,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 22:59:25,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 140 treesize of output 1244 Received shutdown request... [2025-01-22 23:03:38,252 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2025-01-22 23:03:38,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-22 23:03:38,264 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-22 23:03:38,265 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-22 23:03:38,266 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-22 23:03:38,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 23:03:38,453 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. [2025-01-22 23:03:38,454 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-22 23:03:38,454 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-22 23:03:38,454 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-22 23:03:38,454 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-22 23:03:38,461 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1] [2025-01-22 23:03:38,464 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-22 23:03:38,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-22 23:03:38,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-22 23:03:38,479 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.01 11:03:38 BasicIcfg [2025-01-22 23:03:38,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-22 23:03:38,480 INFO L158 Benchmark]: Toolchain (without parser) took 840723.56ms. Allocated memory was 117.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 80.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2025-01-22 23:03:38,480 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 23:03:38,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.32ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 23:03:38,480 INFO L158 Benchmark]: Boogie Preprocessor took 17.69ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.7MB in the end (delta: 699.2kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 23:03:38,480 INFO L158 Benchmark]: RCFGBuilder took 291.33ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 67.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-22 23:03:38,481 INFO L158 Benchmark]: TraceAbstraction took 840383.86ms. Allocated memory was 117.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 66.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2025-01-22 23:03:38,482 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.32ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 17.69ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.7MB in the end (delta: 699.2kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 291.33ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 67.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 840383.86ms. Allocated memory was 117.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 66.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. 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: 41299, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 4480, dependent conditional: 4470, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38614, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 1795, dependent conditional: 1785, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38614, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 1795, dependent conditional: 1785, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 12446, dependent conditional: 12436, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 1036, independent unconditional: 35783, dependent: 12446, dependent conditional: 2674, dependent unconditional: 9772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 1036, independent unconditional: 35783, dependent: 12446, dependent conditional: 2674, dependent unconditional: 9772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1405, independent: 1137, independent conditional: 625, independent unconditional: 512, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1405, independent: 507, independent conditional: 0, independent unconditional: 507, dependent: 898, dependent conditional: 0, dependent unconditional: 898, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 898, independent: 630, independent conditional: 625, independent unconditional: 5, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 898, independent: 630, independent conditional: 625, independent unconditional: 5, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6363, independent: 3759, independent conditional: 3671, independent unconditional: 88, dependent: 2604, dependent conditional: 2285, dependent unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 49265, independent: 35682, independent conditional: 411, independent unconditional: 35271, dependent: 12178, dependent conditional: 2419, dependent unconditional: 9759, unknown: 1405, unknown conditional: 880, unknown unconditional: 525] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1138, Positive conditional cache size: 626, Positive unconditional cache size: 512, Negative cache size: 268, Negative conditional cache size: 255, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44946, Maximal queried relation: 6, Independence queries for same thread: 2685, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 134, Number of trivial persistent sets: 78, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 609, independent: 599, independent conditional: 0, independent unconditional: 599, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 41299, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 4480, dependent conditional: 4470, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38614, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 1795, dependent conditional: 1785, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38614, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 1795, dependent conditional: 1785, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 36220, independent unconditional: 599, dependent: 12446, dependent conditional: 12436, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 1036, independent unconditional: 35783, dependent: 12446, dependent conditional: 2674, dependent unconditional: 9772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49265, independent: 36819, independent conditional: 1036, independent unconditional: 35783, dependent: 12446, dependent conditional: 2674, dependent unconditional: 9772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1405, independent: 1137, independent conditional: 625, independent unconditional: 512, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1405, independent: 507, independent conditional: 0, independent unconditional: 507, dependent: 898, dependent conditional: 0, dependent unconditional: 898, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 898, independent: 630, independent conditional: 625, independent unconditional: 5, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 898, independent: 630, independent conditional: 625, independent unconditional: 5, dependent: 268, dependent conditional: 255, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6363, independent: 3759, independent conditional: 3671, independent unconditional: 88, dependent: 2604, dependent conditional: 2285, dependent unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 49265, independent: 35682, independent conditional: 411, independent unconditional: 35271, dependent: 12178, dependent conditional: 2419, dependent unconditional: 9759, unknown: 1405, unknown conditional: 880, unknown unconditional: 525] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1138, Positive conditional cache size: 626, Positive unconditional cache size: 512, Negative cache size: 268, Negative conditional cache size: 255, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44946, Maximal queried relation: 6, Independence queries for same thread: 2685 - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-13-10-13-9-12-8-10-7-6-6-6-5-4-6-4-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 47 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 840.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 207.3s, 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: 708, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 307.1s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 714 ConstructedInterpolants, 16 QuantifiedInterpolants, 30513 SizeOfPredicates, 66 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 152/1293 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]: 2590, ConditionCalculationTime [ms]: 16, ConditionCalculations: 2, QuantifiedConditions: 0, TraceChecks: 1, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 1 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown