/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 false --traceabstraction.commutativity.condition.synthesis NONE -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/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-22 16:35:43,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-22 16:35:44,039 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 16:35:44,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-22 16:35:44,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-22 16:35:44,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-22 16:35:44,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-22 16:35:44,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-22 16:35:44,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-22 16:35:44,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-22 16:35:44,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-22 16:35:44,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-22 16:35:44,066 INFO L153 SettingsManager]: * Use SBE=true [2025-01-22 16:35:44,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-22 16:35:44,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-22 16:35:44,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-22 16:35:44,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-22 16:35:44,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-22 16:35:44,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-22 16:35:44,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 16:35:44,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-22 16:35:44,075 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-22 16:35:44,075 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-01-22 16:35:44,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-22 16:35:44,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-22 16:35:44,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-22 16:35:44,291 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-22 16:35:44,292 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-22 16:35:44,293 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/simple-array-sum.wvr.bpl [2025-01-22 16:35:44,293 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2025-01-22 16:35:44,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-22 16:35:44,312 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-22 16:35:44,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-22 16:35:44,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-22 16:35:44,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-22 16:35:44,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,331 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-22 16:35:44,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-22 16:35:44,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-22 16:35:44,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-22 16:35:44,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-22 16:35:44,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-22 16:35:44,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-22 16:35:44,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-22 16:35:44,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-22 16:35:44,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/1) ... [2025-01-22 16:35:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 16:35:44,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:44,371 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 16:35:44,375 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 16:35:44,396 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-22 16:35:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-22 16:35:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-22 16:35:44,396 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-22 16:35:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-22 16:35:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-22 16:35:44,396 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-22 16:35:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-22 16:35:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-22 16:35:44,397 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-22 16:35:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-22 16:35:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-22 16:35:44,397 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 16:35:44,434 INFO L234 CfgBuilder]: Building ICFG [2025-01-22 16:35:44,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-22 16:35:44,515 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-22 16:35:44,515 INFO L283 CfgBuilder]: Performing block encoding [2025-01-22 16:35:44,545 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-22 16:35:44,546 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-22 16:35:44,546 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 04:35:44 BoogieIcfgContainer [2025-01-22 16:35:44,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-22 16:35:44,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-22 16:35:44,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-22 16:35:44,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-22 16:35:44,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 04:35:44" (1/2) ... [2025-01-22 16:35:44,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83ac4bc and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.01 04:35:44, skipping insertion in model container [2025-01-22 16:35:44,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 04:35:44" (2/2) ... [2025-01-22 16:35:44,555 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2025-01-22 16:35:44,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-22 16:35:44,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-array-sum.wvr.bpl that has 4 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-22 16:35:44,568 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-22 16:35:44,606 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-22 16:35:44,642 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 16:35:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-22 16:35:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:44,646 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 16:35:44,647 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 16:35:44,695 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-22 16:35:44,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-22 16:35:44,714 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;@110ff62b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 16:35:44,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-22 16:35:44,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1141442539, now seen corresponding path program 1 times [2025-01-22 16:35:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455725825] [2025-01-22 16:35:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 16:35:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-22 16:35:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-22 16:35:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 16:35:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:45,180 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 16:35:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455725825] [2025-01-22 16:35:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455725825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 16:35:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 16:35:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-22 16:35:45,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952248805] [2025-01-22 16:35:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 16:35:45,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-22 16:35:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:45,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-22 16:35:45,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-22 16:35:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:45,202 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:45,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 16:35:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-22 16:35:45,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518802, now seen corresponding path program 2 times [2025-01-22 16:35:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972531048] [2025-01-22 16:35:45,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:35:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:45,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-22 16:35:45,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-22 16:35:45,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:35:45,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-22 16:35:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972531048] [2025-01-22 16:35:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972531048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301788804] [2025-01-22 16:35:45,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:35:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:45,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:45,448 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 16:35:45,450 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 16:35:45,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-22 16:35:45,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-22 16:35:45,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:35:45,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:45,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-22 16:35:45,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-22 16:35:45,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-22 16:35:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301788804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 16:35:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-22 16:35:45,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-22 16:35:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230593885] [2025-01-22 16:35:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 16:35:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-22 16:35:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:45,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-22 16:35:45,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-22 16:35:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:45,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:45,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 16:35:45,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:45,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:45,699 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 16:35:45,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:45,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1013696392, now seen corresponding path program 3 times [2025-01-22 16:35:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230614595] [2025-01-22 16:35:45,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 16:35:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:45,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-22 16:35:45,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-22 16:35:45,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 16:35:45,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:35:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230614595] [2025-01-22 16:35:46,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230614595] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:46,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188619811] [2025-01-22 16:35:46,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 16:35:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:46,427 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 16:35:46,428 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 16:35:46,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-22 16:35:46,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-22 16:35:46,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 16:35:46,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:46,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-22 16:35:46,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:46,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-22 16:35:46,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-01-22 16:35:46,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-01-22 16:35:46,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 16:35:46,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2025-01-22 16:35:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:35:47,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:35:47,473 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 46 treesize of output 44 [2025-01-22 16:35:47,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 16:35:47,535 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:47,536 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:47,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 16:35:47,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 37 [2025-01-22 16:35:47,569 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:47,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 16:35:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:47,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 16:35:47,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-01-22 16:35:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:35:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188619811] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:35:47,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:35:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-01-22 16:35:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621138163] [2025-01-22 16:35:47,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:35:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-22 16:35:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-22 16:35:47,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2025-01-22 16:35:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:47,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:47,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 16:35:47,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:47,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:47,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-22 16:35:50,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-22 16:35:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:51,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -289265396, now seen corresponding path program 1 times [2025-01-22 16:35:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967217093] [2025-01-22 16:35:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 16:35:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-22 16:35:51,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-22 16:35:51,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 16:35:51,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-22 16:35:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967217093] [2025-01-22 16:35:51,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967217093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 16:35:51,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 16:35:51,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 16:35:51,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148266076] [2025-01-22 16:35:51,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 16:35:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-22 16:35:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:51,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-22 16:35:51,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-22 16:35:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:51,126 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 16:35:51,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:51,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:51,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2025-01-22 16:35:51,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-22 16:35:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-22 16:35:51,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1475009880, now seen corresponding path program 4 times [2025-01-22 16:35:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534937447] [2025-01-22 16:35:51,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 16:35:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:51,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-22 16:35:51,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-22 16:35:51,195 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 16:35:51,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-22 16:35:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534937447] [2025-01-22 16:35:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534937447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594670415] [2025-01-22 16:35:51,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 16:35:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:51,919 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 16:35:51,920 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 16:35:51,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-22 16:35:51,954 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-22 16:35:51,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 16:35:51,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:51,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-22 16:35:51,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:52,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-22 16:35:52,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-01-22 16:35:52,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2025-01-22 16:35:52,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2025-01-22 16:35:52,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2025-01-22 16:35:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-22 16:35:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:35:52,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:35:53,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 16:35:53,099 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 193458 treesize of output 182194 [2025-01-22 16:35:53,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:53,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:53,199 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:35:53,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 16:35:53,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 42 treesize of output 167 [2025-01-22 16:35:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:35:53,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594670415] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:35:53,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:35:53,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2025-01-22 16:35:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069341025] [2025-01-22 16:35:53,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:35:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-22 16:35:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-22 16:35:53,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2025-01-22 16:35:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:53,848 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.340909090909091) internal successors, (103), 43 states have internal predecessors, (103), 0 states have call successors, (0), 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 16:35:53,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:53,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-22 16:35:53,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2025-01-22 16:35:53,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:53,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-22 16:35:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:56,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:56,562 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 16:35:56,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:56,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1332926988, now seen corresponding path program 2 times [2025-01-22 16:35:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357519727] [2025-01-22 16:35:56,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:35:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:56,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-22 16:35:56,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-22 16:35:56,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:35:56,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 81 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-22 16:35:56,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357519727] [2025-01-22 16:35:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357519727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060433461] [2025-01-22 16:35:56,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:35:56,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:56,857 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 16:35:56,858 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 16:35:56,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-22 16:35:56,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-22 16:35:56,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:35:56,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:56,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-22 16:35:56,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-22 16:35:56,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:35:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-22 16:35:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060433461] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:35:57,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:35:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2025-01-22 16:35:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237401868] [2025-01-22 16:35:57,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:35:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-22 16:35:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-22 16:35:57,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-22 16:35:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:57,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:57,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:57,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:35:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:57,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-22 16:35:57,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:57,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 407025897, now seen corresponding path program 5 times [2025-01-22 16:35:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642332189] [2025-01-22 16:35:57,549 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 16:35:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:57,555 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 6 equivalence classes. [2025-01-22 16:35:57,595 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 57 of 57 statements. [2025-01-22 16:35:57,595 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-22 16:35:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-22 16:35:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:57,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642332189] [2025-01-22 16:35:57,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642332189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:57,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4206988] [2025-01-22 16:35:57,707 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 16:35:57,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:57,709 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 16:35:57,711 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 16:35:57,735 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 6 equivalence classes. [2025-01-22 16:35:57,754 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 57 of 57 statements. [2025-01-22 16:35:57,754 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-22 16:35:57,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:57,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-22 16:35:57,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-22 16:35:57,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:35:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-22 16:35:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4206988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:35:57,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:35:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-01-22 16:35:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149681879] [2025-01-22 16:35:57,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:35:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-22 16:35:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:57,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-22 16:35:57,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-22 16:35:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:57,921 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:57,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:35:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-22 16:35:58,239 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 16:35:58,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:58,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:58,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 563669668, now seen corresponding path program 6 times [2025-01-22 16:35:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253762123] [2025-01-22 16:35:58,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 16:35:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:58,438 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 82 statements into 7 equivalence classes. [2025-01-22 16:35:58,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 82 of 82 statements. [2025-01-22 16:35:58,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-22 16:35:58,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 19 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-22 16:35:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:35:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253762123] [2025-01-22 16:35:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253762123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:35:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703025639] [2025-01-22 16:35:58,716 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 16:35:58,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:58,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:35:58,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 16:35:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-22 16:35:58,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 82 statements into 7 equivalence classes. [2025-01-22 16:35:58,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 82 of 82 statements. [2025-01-22 16:35:58,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-22 16:35:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:35:58,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-22 16:35:58,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:35:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-22 16:35:58,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:35:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-22 16:35:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703025639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:35:58,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:35:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2025-01-22 16:35:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101727588] [2025-01-22 16:35:58,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:35:58,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-22 16:35:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:35:58,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-22 16:35:58,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-22 16:35:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:58,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:35:58,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 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 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-01-22 16:35:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:35:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:35:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:35:59,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-22 16:35:59,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:35:59,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:35:59,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:35:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1491351976, now seen corresponding path program 7 times [2025-01-22 16:35:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:35:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285579175] [2025-01-22 16:35:59,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-22 16:35:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:35:59,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-22 16:35:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-22 16:35:59,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 16:35:59,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 119 proven. 28 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-01-22 16:36:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:36:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285579175] [2025-01-22 16:36:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285579175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:36:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828261833] [2025-01-22 16:36:00,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-22 16:36:00,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:36:00,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:36:00,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 16:36:00,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-22 16:36:00,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-22 16:36:00,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-22 16:36:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 16:36:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:00,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-22 16:36:00,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:36:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-22 16:36:00,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:36:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-22 16:36:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828261833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:36:00,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:36:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2025-01-22 16:36:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799994797] [2025-01-22 16:36:00,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:36:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-22 16:36:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:36:00,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-22 16:36:00,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-22 16:36:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:36:00,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:36:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 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 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:36:00,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:36:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-22 16:36:00,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-22 16:36:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:36:01,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:36:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:36:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1863050141, now seen corresponding path program 8 times [2025-01-22 16:36:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:36:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765076589] [2025-01-22 16:36:01,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:36:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:36:01,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-22 16:36:01,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-22 16:36:01,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:36:01,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-22 16:36:01,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:36:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765076589] [2025-01-22 16:36:01,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765076589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:36:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989082518] [2025-01-22 16:36:01,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 16:36:01,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:36:01,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:36:01,249 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 16:36:01,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-22 16:36:01,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-22 16:36:01,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-22 16:36:01,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 16:36:01,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:01,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-22 16:36:01,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:36:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-22 16:36:01,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:36:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-22 16:36:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989082518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:36:01,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:36:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2025-01-22 16:36:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671858890] [2025-01-22 16:36:01,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:36:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-22 16:36:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:36:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-22 16:36:01,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-22 16:36:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:36:01,603 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:36:01,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-22 16:36:01,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:36:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:36:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:36:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:36:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:36:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:36:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:36:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:36:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:36:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-22 16:36:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-22 16:36:01,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-22 16:36:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:36:02,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 16:36:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 16:36:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1139181790, now seen corresponding path program 9 times [2025-01-22 16:36:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 16:36:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606055805] [2025-01-22 16:36:02,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 16:36:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 16:36:02,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-01-22 16:36:02,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-01-22 16:36:02,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-22 16:36:02,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-22 16:36:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 16:36:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606055805] [2025-01-22 16:36:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606055805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 16:36:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222019269] [2025-01-22 16:36:04,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 16:36:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:36:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 16:36:04,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 16:36:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-22 16:36:04,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-01-22 16:36:04,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-01-22 16:36:04,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-22 16:36:04,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 16:36:04,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 172 conjuncts are in the unsatisfiable core [2025-01-22 16:36:04,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 16:36:04,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-22 16:36:05,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-01-22 16:36:05,299 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-22 16:36:05,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 43 [2025-01-22 16:36:05,550 INFO L349 Elim1Store]: treesize reduction 80, result has 20.0 percent of original size [2025-01-22 16:36:05,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 69 [2025-01-22 16:36:05,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 16:36:05,889 INFO L349 Elim1Store]: treesize reduction 128, result has 18.5 percent of original size [2025-01-22 16:36:05,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 78 treesize of output 99 [2025-01-22 16:36:06,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2025-01-22 16:36:06,478 INFO L349 Elim1Store]: treesize reduction 120, result has 20.5 percent of original size [2025-01-22 16:36:06,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 101 [2025-01-22 16:36:06,792 INFO L349 Elim1Store]: treesize reduction 168, result has 15.6 percent of original size [2025-01-22 16:36:06,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 92 treesize of output 112 [2025-01-22 16:36:07,204 INFO L349 Elim1Store]: treesize reduction 216, result has 12.6 percent of original size [2025-01-22 16:36:07,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 130 treesize of output 149 [2025-01-22 16:36:07,634 INFO L349 Elim1Store]: treesize reduction 264, result has 10.5 percent of original size [2025-01-22 16:36:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 143 treesize of output 165 [2025-01-22 16:36:08,560 INFO L349 Elim1Store]: treesize reduction 408, result has 10.7 percent of original size [2025-01-22 16:36:08,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 28 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 46 case distinctions, treesize of input 149 treesize of output 190 [2025-01-22 16:36:09,883 INFO L349 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2025-01-22 16:36:09,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 81 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 72 case distinctions, treesize of input 207 treesize of output 475 [2025-01-22 16:36:10,019 INFO L349 Elim1Store]: treesize reduction 168, result has 33.6 percent of original size [2025-01-22 16:36:10,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 12 case distinctions, treesize of input 634 treesize of output 548 [2025-01-22 16:36:11,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 41 [2025-01-22 16:36:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:36:11,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 16:37:22,440 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:26,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 17362061229618 treesize of output 16958334303794 [2025-01-22 16:37:54,446 WARN L286 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 316141 DAG size of output: 253 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-22 16:37:55,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,123 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,123 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,124 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,124 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,124 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,128 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,128 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,130 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,130 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,131 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,132 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,132 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,134 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,134 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,134 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:55,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 16:37:57,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 16:37:57,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 24 select indices, 24 select index equivalence classes, 66 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 210 case distinctions, treesize of input 120 treesize of output 1447 [2025-01-22 16:39:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 252 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 16:39:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222019269] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 16:39:42,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 16:39:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 44, 44] total 114 [2025-01-22 16:39:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847493374] [2025-01-22 16:39:42,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 16:39:42,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2025-01-22 16:39:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 16:39:42,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2025-01-22 16:39:42,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1539, Invalid=11556, Unknown=15, NotChecked=0, Total=13110 [2025-01-22 16:39:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:39:42,032 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 16:39:42,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.243478260869565) internal successors, (258), 114 states have internal predecessors, (258), 0 states have call successors, (0), 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 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-22 16:39:42,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 16:39:51,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse53 (select c_A c_k))) (let ((.cse35 (select c_C c_l)) (.cse1 (store c_C c_k (+ .cse53 1))) (.cse49 (+ c_k 1))) (let ((.cse38 (store .cse1 .cse49 (+ (select c_A .cse49) 1))) (.cse43 (+ c_l 4)) (.cse2 (+ c_l 1)) (.cse13 (+ c_asum c_l 1)) (.cse10 (+ .cse35 c_csum)) (.cse15 (select c_A (+ c_i 6))) (.cse16 (select c_A c_i)) (.cse17 (select c_A (+ c_i 1))) (.cse18 (select c_A (+ 5 c_i))) (.cse20 (select c_A (+ 2 c_i))) (.cse21 (select c_A (+ c_i 4))) (.cse22 (select c_A (+ 3 c_i))) (.cse33 (+ 3 c_l)) (.cse24 (+ 2 c_l))) (let ((.cse28 (select c_C 1)) (.cse29 (select c_A 1)) (.cse31 (select c_C 0)) (.cse32 (select c_A 0)) (.cse34 (+ 3 c_asum c_l)) (.cse3 (select c_A .cse24)) (.cse4 (select c_A .cse33)) (.cse0 (+ .cse15 .cse16 .cse17 .cse18 .cse20 2 .cse21 .cse22 c_asum c_l)) (.cse11 (<= .cse13 .cse10)) (.cse12 (< .cse2 c_N)) (.cse14 (not (= .cse16 .cse53))) (.cse26 (< c_k c_l)) (.cse19 (select c_A (+ 7 c_i))) (.cse40 (select c_A (+ c_i 8))) (.cse5 (select c_A .cse43)) (.cse44 (select c_A (+ 9 c_l))) (.cse6 (select c_A (+ 6 c_l))) (.cse25 (select c_A (+ 8 c_l))) (.cse7 (select c_A (+ 5 c_l))) (.cse39 (select .cse38 .cse2)) (.cse8 (select c_A (+ 7 c_l))) (.cse9 (select .cse1 c_l)) (.cse23 (let ((.cse52 (+ 2 c_k))) (store .cse38 .cse52 (+ (select c_A .cse52) 1)))) (.cse36 (select c_C (+ (- 1) c_N)))) (and (= .cse0 (+ (select .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 c_csum .cse9)) (= 3 c_l) (or (and (<= .cse10 (+ c_N c_asum)) .cse11) .cse12) (or (= .cse10 .cse13) .cse14) (or (= (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 3 .cse21 .cse22 c_asum c_l) (+ .cse4 .cse5 (select .cse23 .cse24) .cse6 .cse25 .cse7 .cse8 c_csum .cse9 (select .cse23 .cse2))) .cse26) (let ((.cse27 (+ (- 2) c_k))) (= (select c_C .cse27) (+ (select c_A .cse27) 1))) (= .cse28 (+ .cse29 1)) (let ((.cse30 (+ (- 1) c_k))) (= (+ (select c_A .cse30) 1) (select c_C .cse30))) (or (= (+ .cse28 .cse31 (select c_C 2)) c_csum) (= 3 c_k)) (= (+ .cse29 (select c_A 3) .cse32 (select c_A 2)) c_asum) (= .cse31 (+ .cse32 1)) (or (not (= .cse33 c_i)) (not (= c_p c_i)) (= .cse34 (+ (select c_C (+ (- 2) c_p)) (select c_C (+ (- 1) c_p)) .cse35 c_csum))) (or (< .cse33 c_N) (< c_k c_N) (let ((.cse37 (select c_C (+ (- 2) c_N)))) (and (<= (+ c_p .cse36 .cse35 c_csum .cse37) (+ c_N 3 c_asum c_l)) (<= .cse34 (+ .cse36 .cse35 c_csum .cse37)))) (< c_p .cse33)) (<= c_k 4) (or .cse26 (= (+ (select .cse38 c_l) .cse3 .cse4 .cse5 .cse6 .cse7 .cse39 .cse8 c_csum) .cse0)) (forall ((v_k_127 Int)) (or (= (+ .cse15 .cse16 .cse17 .cse18 .cse19 (select c_A (+ 9 c_i)) .cse20 5 .cse40 .cse21 .cse22 c_asum c_l) (let ((.cse45 (store .cse1 v_k_127 (+ (select c_A v_k_127) 1)))) (let ((.cse41 (let ((.cse48 (+ v_k_127 1))) (store .cse45 .cse48 (+ 1 (select c_A .cse48)))))) (let ((.cse42 (let ((.cse47 (+ 3 v_k_127))) (store (let ((.cse46 (+ 2 v_k_127))) (store .cse41 .cse46 (+ (select c_A .cse46) 1))) .cse47 (+ (select c_A .cse47) 1))))) (+ (select .cse41 .cse24) (select .cse42 .cse43) (select c_A (+ c_l 10)) .cse44 .cse6 .cse25 .cse7 (select .cse42 .cse33) (select .cse45 .cse2) .cse8 c_csum .cse9))))) (< v_k_127 .cse2) (< .cse49 v_k_127))) (= c_p c_k) (or (< c_p .cse2) (and .cse11 (<= (+ c_p .cse35 c_csum) (+ c_N c_asum c_l 1))) .cse12) (or .cse14 (= (+ c_asum c_l) c_csum) (not (= c_k c_l))) (= c_i 4) (or .cse26 (= (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse40 .cse21 .cse22 c_asum c_l 4) (let ((.cse50 (let ((.cse51 (+ 3 c_k))) (store .cse23 .cse51 (+ (select c_A .cse51) 1))))) (+ .cse5 .cse44 (select .cse50 .cse24) .cse6 .cse25 .cse7 (select .cse50 .cse33) .cse39 .cse8 c_csum .cse9)))) (or (< .cse24 c_N) (< c_p .cse24) (and (<= (+ c_p .cse36 .cse35 c_csum) (+ c_N 2 c_asum c_l)) (<= (+ 2 c_asum c_l) (+ .cse36 .cse35 c_csum))))))))) is different from false [2025-01-22 16:41:51,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:43:42,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse45 (+ c_k 1)) (.cse24 (select c_A c_k))) (let ((.cse44 (store c_C c_k (+ .cse24 1))) (.cse21 (select c_A .cse45))) (let ((.cse39 (+ c_l 4)) (.cse28 (+ 3 c_l)) (.cse11 (+ 2 c_l)) (.cse0 (select c_A (+ c_i 6))) (.cse1 (select c_A c_i)) (.cse2 (select c_A (+ c_i 1))) (.cse3 (select c_A (+ 5 c_i))) (.cse5 (select c_A (+ 2 c_i))) (.cse6 (select c_A (+ c_i 4))) (.cse7 (select c_A (+ 3 c_i))) (.cse27 (+ 2 c_k)) (.cse33 (store .cse44 .cse45 (+ .cse21 1))) (.cse17 (+ c_l 1))) (let ((.cse29 (+ 3 c_asum c_l)) (.cse25 (select c_A (+ 9 c_i))) (.cse22 (select c_A (+ c_l 10))) (.cse19 (+ c_asum c_l)) (.cse18 (< c_k c_l)) (.cse4 (select c_A (+ 7 c_i))) (.cse26 (select c_A (+ c_i 8))) (.cse23 (select c_A (+ 9 c_l))) (.cse13 (select c_A (+ 8 c_l))) (.cse35 (select .cse33 .cse17)) (.cse10 (store .cse33 .cse27 (+ (select c_A .cse27) 1))) (.cse31 (select c_C (+ (- 1) c_N))) (.cse30 (select c_C c_l)) (.cse20 (= c_k c_l)) (.cse36 (+ .cse0 .cse1 .cse2 .cse3 .cse5 2 .cse6 .cse7 c_asum c_l)) (.cse34 (select c_A .cse11)) (.cse8 (select c_A .cse28)) (.cse9 (select c_A .cse39)) (.cse12 (select c_A (+ 6 c_l))) (.cse14 (select c_A (+ 5 c_l))) (.cse15 (select c_A (+ 7 c_l))) (.cse16 (select .cse44 c_l)) (.cse46 (< c_p .cse17))) (and (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 3 .cse6 .cse7 c_asum c_l) (+ .cse8 .cse9 (select .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 c_csum .cse16 (select .cse10 .cse17))) .cse18) (or (not (= c_i c_l)) (= .cse19 c_csum) (not .cse20)) (= c_csum (+ c_N c_asum)) (forall ((v_k_127 Int)) (or (= (+ (select c_A (+ 3 v_k_127)) .cse21 .cse22 .cse23 .cse12 .cse13 (select c_A (+ c_l 11)) (select c_A (+ 2 v_k_127)) (select c_A v_k_127) .cse15 .cse24 c_csum (select c_A (+ v_k_127 1))) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 (select c_A (+ c_i 10)) .cse26 .cse6 .cse7 c_asum c_l)) (< .cse27 v_k_127) (< v_k_127 .cse11))) (or (not (= .cse28 c_i)) (not (= c_p c_i)) (= .cse29 (+ (select c_C (+ (- 2) c_p)) (select c_C (+ (- 1) c_p)) .cse30 c_csum))) (or (< .cse28 c_N) (< c_k c_N) (let ((.cse32 (select c_C (+ (- 2) c_N)))) (and (<= (+ c_p .cse31 .cse30 c_csum .cse32) (+ c_N 3 c_asum c_l)) (<= .cse29 (+ .cse31 .cse30 c_csum .cse32)))) (< c_p .cse28)) (or .cse18 (= (+ (select .cse33 c_l) .cse34 .cse8 .cse9 .cse12 .cse14 .cse35 .cse15 c_csum) .cse36)) (or .cse18 .cse20) (forall ((v_k_127 Int)) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 5 .cse26 .cse6 .cse7 c_asum c_l) (let ((.cse40 (store .cse44 v_k_127 (+ (select c_A v_k_127) 1)))) (let ((.cse37 (let ((.cse43 (+ v_k_127 1))) (store .cse40 .cse43 (+ 1 (select c_A .cse43)))))) (let ((.cse38 (let ((.cse42 (+ 3 v_k_127))) (store (let ((.cse41 (+ 2 v_k_127))) (store .cse37 .cse41 (+ (select c_A .cse41) 1))) .cse42 (+ (select c_A .cse42) 1))))) (+ (select .cse37 .cse11) (select .cse38 .cse39) .cse22 .cse23 .cse12 .cse13 .cse14 (select .cse38 .cse28) (select .cse40 .cse17) .cse15 c_csum .cse16))))) (< v_k_127 .cse17) (< .cse45 v_k_127))) (= c_p c_k) (or .cse46 (and (<= (+ c_asum c_l 1) (+ .cse30 c_csum)) (<= (+ c_p .cse30 c_csum) (+ c_N c_asum c_l 1))) (< .cse17 c_N)) (= .cse19 (+ .cse24 c_csum)) (or .cse18 (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse7 c_asum c_l 4) (let ((.cse47 (let ((.cse48 (+ 3 c_k))) (store .cse10 .cse48 (+ (select c_A .cse48) 1))))) (+ .cse9 .cse23 (select .cse47 .cse11) .cse12 .cse13 .cse14 (select .cse47 .cse28) .cse35 .cse15 c_csum .cse16)))) (or (< .cse11 c_N) (< c_p .cse11) (and (<= (+ c_p .cse31 .cse30 c_csum) (+ c_N 2 c_asum c_l)) (<= (+ 2 c_asum c_l) (+ .cse31 .cse30 c_csum)))) .cse20 (or (= .cse36 (+ (select .cse44 .cse17) .cse34 .cse8 .cse9 .cse12 .cse14 .cse15 c_csum .cse16)) .cse46)))))) is different from false [2025-01-22 16:43:44,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:43:47,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:43:49,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse42 (+ c_k 1)) (.cse27 (select c_A c_k))) (let ((.cse85 (+ c_i 1)) (.cse55 (+ c_l 1)) (.cse84 (+ 2 c_k)) (.cse83 (+ 3 c_k)) (.cse53 (+ 2 c_l)) (.cse72 (store c_C c_k (+ .cse27 1))) (.cse21 (select c_A .cse42))) (let ((.cse61 (store .cse72 .cse42 (+ .cse21 1))) (.cse68 (+ 5 c_l)) (.cse40 (+ c_l 4)) (.cse50 (select c_A (+ c_i 6))) (.cse18 (select c_A (+ 5 c_i))) (.cse19 (select c_A (+ c_i 4))) (.cse39 (+ 3 c_l)) (.cse38 (select c_C .cse53)) (.cse22 (select c_A .cse83)) (.cse23 (select c_A (+ c_k 4))) (.cse24 (select c_A .cse84)) (.cse25 (select c_C .cse55)) (.cse26 (select c_C c_l)) (.cse1 (select c_A c_i)) (.cse2 (select c_A .cse85)) (.cse3 (select c_A (+ 2 c_i))) (.cse20 (select c_A (+ 3 c_i)))) (let ((.cse31 (+ .cse1 .cse2 .cse3 .cse20 c_asum c_l 1)) (.cse29 (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 c_csum)) (.cse32 (+ .cse38 .cse21 .cse25 .cse26 .cse27 c_csum)) (.cse35 (+ .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 c_csum)) (.cse6 (+ .cse1 .cse2 .cse3 c_asum c_k 1)) (.cse33 (+ .cse1 .cse2 c_asum c_k 1)) (.cse34 (+ .cse1 .cse2 2 c_asum c_l)) (.cse4 (+ .cse38 .cse21 .cse24 .cse25 .cse26 .cse27 c_csum)) (.cse43 (+ 3 c_asum c_l)) (.cse9 (select c_A .cse53)) (.cse10 (select c_A .cse39)) (.cse7 (+ .cse50 .cse1 .cse2 .cse18 .cse3 2 .cse19 .cse20 c_asum c_l)) (.cse8 (select .cse72 .cse55)) (.cse59 (< .cse39 c_N)) (.cse44 (select c_C (+ (- 2) c_N))) (.cse48 (+ c_asum c_k 1)) (.cse45 (+ c_asum c_l 1)) (.cse28 (< c_k .cse53)) (.cse49 (+ .cse1 c_asum c_k 1)) (.cse75 (+ .cse21 .cse25 .cse26 .cse27 c_csum)) (.cse16 (< .cse53 c_k)) (.cse73 (select c_A (+ 9 c_i))) (.cse65 (select c_A (+ c_l 10))) (.cse46 (not (= .cse1 .cse27))) (.cse56 (< c_k c_l)) (.cse51 (select c_A (+ 7 c_i))) (.cse74 (select c_A (+ c_i 8))) (.cse11 (select c_A .cse40)) (.cse66 (select c_A (+ 9 c_l))) (.cse12 (select c_A (+ 6 c_l))) (.cse54 (select c_A (+ 8 c_l))) (.cse13 (select c_A .cse68)) (.cse62 (select .cse61 .cse55)) (.cse14 (select c_A (+ 7 c_l))) (.cse15 (select .cse72 c_l)) (.cse52 (store .cse61 .cse84 (+ .cse24 1))) (.cse41 (< c_i .cse42)) (.cse58 (+ 2 c_asum c_l)) (.cse60 (select c_C (+ (- 1) c_N))) (.cse0 (< c_k .cse39)) (.cse30 (+ .cse1 .cse2 .cse3 .cse20 c_asum c_k 1)) (.cse5 (< .cse39 c_k))) (and (or .cse0 (and (or (< (+ .cse1 .cse2 .cse3 2 c_asum c_l) .cse4) .cse5) (or (< .cse4 .cse6) .cse5))) (= .cse7 (+ .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 c_csum .cse15)) (or (let ((.cse17 (+ .cse21 .cse22 (select c_A (+ 5 c_k)) .cse23 .cse24 .cse25 .cse26 .cse27 c_csum))) (and (or .cse16 (< .cse17 (+ .cse1 .cse2 .cse18 .cse3 .cse19 .cse20 c_asum c_k 1))) (or (< (+ .cse1 .cse2 .cse18 .cse3 .cse19 .cse20 c_asum c_l 1) .cse17) .cse16))) .cse28) (or (= c_csum (+ c_N c_asum)) (< c_l c_N)) (or (and (or .cse16 (< .cse29 .cse30)) (or .cse16 (< .cse31 .cse29))) .cse28) (or .cse0 (and (or (< .cse32 .cse33) .cse5) (or (< .cse34 .cse32) .cse5))) (or .cse28 (and (or (< .cse31 .cse35) .cse16) (or (< .cse35 .cse30) .cse16))) (or (let ((.cse36 (< .cse40 c_k)) (.cse37 (+ .cse38 .cse21 (select c_C .cse39) .cse25 .cse26 .cse27 c_csum))) (and (or .cse36 (< (+ .cse1 .cse2 3 c_asum c_l) .cse37)) (or .cse36 (< .cse37 .cse33)))) (< c_k .cse40)) (or (and (or .cse16 (< .cse29 (+ .cse1 .cse2 .cse3 .cse19 .cse20 c_asum c_k 1))) (or (< (+ .cse1 .cse2 .cse3 .cse19 .cse20 c_asum c_l 1) .cse29) .cse16)) .cse28) (or .cse41 (< .cse42 c_N) (not (= .cse39 c_k)) (and (= .cse43 (+ .cse26 .cse27 c_csum (select c_C (+ (- 2) c_k)) .cse44)) (<= c_i c_N))) (or (= (+ .cse26 c_csum) .cse45) .cse46) (or .cse28 (let ((.cse47 (+ .cse25 .cse26 .cse27 c_csum))) (and (or (< .cse45 .cse47) .cse16) (or (< .cse47 .cse48) .cse16)))) (or .cse0 (and (or (< .cse32 .cse49) .cse5) (or (< (+ .cse1 2 c_asum c_l) .cse32) .cse5))) (or (= (+ .cse50 .cse1 .cse2 .cse18 .cse51 .cse3 3 .cse19 .cse20 c_asum c_l) (+ .cse10 .cse11 (select .cse52 .cse53) .cse12 .cse54 .cse13 .cse14 c_csum .cse15 (select .cse52 .cse55))) .cse56) (or .cse0 (let ((.cse57 (+ .cse38 .cse25 .cse26 .cse27 c_csum))) (and (or (< .cse57 .cse48) .cse5) (or (< .cse58 .cse57) .cse5)))) (or (and (or (< (+ .cse1 .cse2 .cse3 c_asum c_l 1) .cse35) .cse16) (or .cse16 (< .cse35 .cse6))) .cse28) (or .cse0 (and (or (< .cse4 .cse33) .cse5) (or (< .cse34 .cse4) .cse5))) (or (not (= .cse39 c_i)) (not (= c_p c_i)) (= .cse43 (+ (select c_C (+ (- 2) c_p)) (select c_C (+ (- 1) c_p)) .cse26 c_csum))) (or .cse59 (< c_k c_N) (and (<= (+ c_p .cse60 .cse26 c_csum .cse44) (+ c_N 3 c_asum c_l)) (<= .cse43 (+ .cse60 .cse26 c_csum .cse44))) (< c_p .cse39)) (or .cse56 (= (+ (select .cse61 c_l) .cse9 .cse10 .cse11 .cse12 .cse13 .cse62 .cse14 c_csum) .cse7)) (forall ((v_k_127 Int)) (or (= (let ((.cse67 (store .cse72 v_k_127 (+ (select c_A v_k_127) 1)))) (let ((.cse63 (let ((.cse71 (+ v_k_127 1))) (store .cse67 .cse71 (+ 1 (select c_A .cse71)))))) (let ((.cse64 (let ((.cse70 (+ 3 v_k_127))) (store (let ((.cse69 (+ 2 v_k_127))) (store .cse63 .cse69 (+ (select c_A .cse69) 1))) .cse70 (+ (select c_A .cse70) 1))))) (+ (select .cse63 .cse39) .cse8 (select .cse64 .cse40) .cse65 .cse66 .cse12 .cse54 (select c_A (+ c_l 11)) (select .cse67 .cse53) .cse26 (select .cse64 .cse68) .cse14 c_csum)))) (+ .cse50 .cse1 .cse2 .cse18 .cse51 .cse73 .cse3 6 (select c_A (+ c_i 10)) .cse74 .cse19 .cse20 c_asum c_l)) (< v_k_127 .cse53) (< .cse42 v_k_127))) (or .cse59 (and (<= (+ .cse26 .cse27 c_k c_csum .cse44) (+ c_N c_asum c_l 1)) (<= .cse58 (+ .cse26 .cse27 c_csum .cse44))) .cse28) (or (and (or (< .cse75 .cse48) .cse16) (or (< .cse45 .cse75) .cse16)) .cse28) (or .cse28 (and (or (< .cse75 .cse49) .cse16) (or (< (+ .cse1 c_asum c_l 1) .cse75) .cse16))) (forall ((v_k_127 Int)) (or (= (+ .cse50 .cse1 .cse2 .cse18 .cse51 .cse73 .cse3 5 .cse74 .cse19 .cse20 c_asum c_l) (let ((.cse78 (store .cse72 v_k_127 (+ (select c_A v_k_127) 1)))) (let ((.cse76 (let ((.cse81 (+ v_k_127 1))) (store .cse78 .cse81 (+ 1 (select c_A .cse81)))))) (let ((.cse77 (let ((.cse80 (+ 3 v_k_127))) (store (let ((.cse79 (+ 2 v_k_127))) (store .cse76 .cse79 (+ (select c_A .cse79) 1))) .cse80 (+ (select c_A .cse80) 1))))) (+ (select .cse76 .cse53) (select .cse77 .cse40) .cse65 .cse66 .cse12 .cse54 .cse13 (select .cse77 .cse39) (select .cse78 .cse55) .cse14 c_csum .cse15))))) (< v_k_127 .cse55) (< .cse42 v_k_127))) (= c_p c_k) (or .cse46 (= (+ c_asum c_l) c_csum) (not (= c_k c_l))) (or .cse56 (= (+ .cse50 .cse1 .cse2 .cse18 .cse51 .cse3 .cse74 .cse19 .cse20 c_asum c_l 4) (let ((.cse82 (store .cse52 .cse83 (+ .cse22 1)))) (+ .cse11 .cse66 (select .cse82 .cse53) .cse12 .cse54 .cse13 (select .cse82 .cse39) .cse62 .cse14 c_csum .cse15)))) (or .cse41 (< .cse84 c_N) (not (= c_k .cse53)) (and (<= .cse85 c_N) (= .cse58 (+ .cse26 .cse27 c_csum (select c_C (+ (- 1) c_k)))))) (or (< .cse53 c_N) (< c_p .cse53) (and (<= (+ c_p .cse60 .cse26 c_csum) (+ c_N 2 c_asum c_l)) (<= .cse58 (+ .cse60 .cse26 c_csum)))) (or .cse0 (let ((.cse86 (+ .cse38 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 c_csum))) (and (or (< (+ .cse1 .cse2 .cse3 2 .cse20 c_asum c_l) .cse86) .cse5) (or (< .cse86 .cse30) .cse5))))))))) is different from false [2025-01-22 16:45:11,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:13,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:15,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:17,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:19,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:20,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:22,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:23,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:26,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:28,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:30,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:31,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:33,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:34,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:36,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:38,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:39,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:41,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:44,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:46,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (+ c_k 1)) (.cse11 (select c_A c_k))) (let ((.cse61 (+ 2 c_k)) (.cse59 (store c_C c_k (+ .cse11 1))) (.cse7 (select c_A .cse27))) (let ((.cse60 (+ 3 c_k)) (.cse48 (store .cse59 .cse27 (+ .cse7 1))) (.cse8 (select c_A .cse61))) (let ((.cse36 (store .cse48 .cse61 (+ .cse8 1))) (.cse26 (select c_A .cse60))) (let ((.cse45 (store .cse36 .cse60 (+ .cse26 1))) (.cse55 (+ 5 c_l)) (.cse46 (+ c_l 4)) (.cse33 (select c_A (+ c_i 6))) (.cse1 (select c_A c_i)) (.cse2 (select c_A (+ c_i 1))) (.cse34 (select c_A (+ 5 c_i))) (.cse3 (select c_A (+ 2 c_i))) (.cse23 (select c_A (+ c_i 4))) (.cse24 (select c_A (+ 3 c_i))) (.cse38 (+ c_l 1)) (.cse25 (+ 2 c_l)) (.cse28 (+ 3 c_l))) (let ((.cse0 (< c_k .cse28)) (.cse5 (< .cse28 c_k)) (.cse6 (select c_C .cse25)) (.cse9 (select c_C .cse38)) (.cse29 (+ 3 c_asum c_l)) (.cse30 (select c_C (+ (- 2) c_N))) (.cse14 (select c_A .cse25)) (.cse15 (select c_A .cse28)) (.cse12 (+ .cse33 .cse1 .cse2 .cse34 .cse3 2 .cse23 .cse24 c_asum c_l)) (.cse13 (select .cse59 .cse38)) (.cse43 (select c_A (+ c_l 10))) (.cse49 (select c_A (+ 9 c_i))) (.cse31 (not (= .cse1 .cse11))) (.cse39 (< c_k c_l)) (.cse35 (select c_A (+ 7 c_i))) (.cse50 (select c_A (+ c_i 8))) (.cse16 (select c_A .cse46)) (.cse44 (select c_A (+ 9 c_l))) (.cse17 (select c_A (+ 6 c_l))) (.cse37 (select c_A (+ 8 c_l))) (.cse18 (select c_A .cse55)) (.cse47 (select .cse45 .cse28)) (.cse51 (select .cse48 .cse38)) (.cse19 (select c_A (+ 7 c_l))) (.cse20 (select .cse59 c_l)) (.cse41 (+ 2 c_asum c_l)) (.cse42 (select c_C (+ (- 1) c_N))) (.cse10 (select c_C c_l))) (and (or .cse0 (let ((.cse4 (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 c_csum))) (and (or (< (+ .cse1 .cse2 .cse3 2 c_asum c_l) .cse4) .cse5) (or (< .cse4 (+ .cse1 .cse2 .cse3 c_asum c_k 1)) .cse5)))) (= .cse12 (+ .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 c_csum .cse20)) (or (let ((.cse22 (+ .cse7 .cse26 (select c_A (+ c_k 4)) .cse8 .cse9 .cse10 .cse11 c_csum)) (.cse21 (< .cse25 c_k))) (and (or .cse21 (< .cse22 (+ .cse1 .cse2 .cse3 .cse23 .cse24 c_asum c_k 1))) (or (< (+ .cse1 .cse2 .cse3 .cse23 .cse24 c_asum c_l 1) .cse22) .cse21))) (< c_k .cse25)) (or (< c_i .cse27) (< .cse27 c_N) (not (= .cse28 c_k)) (and (= .cse29 (+ .cse10 .cse11 c_csum (select c_C (+ (- 2) c_k)) .cse30)) (<= c_i c_N))) (or (= (+ .cse10 c_csum) (+ c_asum c_l 1)) .cse31) (or .cse0 (let ((.cse32 (+ .cse6 .cse7 .cse9 .cse10 .cse11 c_csum))) (and (or (< .cse32 (+ .cse1 c_asum c_k 1)) .cse5) (or (< (+ .cse1 2 c_asum c_l) .cse32) .cse5)))) (or (= (+ .cse33 .cse1 .cse2 .cse34 .cse35 .cse3 3 .cse23 .cse24 c_asum c_l) (+ .cse15 .cse16 (select .cse36 .cse25) .cse17 .cse37 .cse18 .cse19 c_csum .cse20 (select .cse36 .cse38))) .cse39) (or .cse0 (let ((.cse40 (+ .cse6 .cse9 .cse10 .cse11 c_csum))) (and (or (< .cse40 (+ c_asum c_k 1)) .cse5) (or (< .cse41 .cse40) .cse5)))) (or (not (= .cse28 c_i)) (not (= c_p c_i)) (= .cse29 (+ (select c_C (+ (- 2) c_p)) (select c_C (+ (- 1) c_p)) .cse10 c_csum))) (or (< .cse28 c_N) (< c_k c_N) (and (<= (+ c_p .cse42 .cse10 c_csum .cse30) (+ c_N 3 c_asum c_l)) (<= .cse29 (+ .cse42 .cse10 c_csum .cse30))) (< c_p .cse28)) (or (< c_k .cse38) (= (+ .cse13 .cse43 .cse44 .cse17 (select .cse45 .cse46) .cse37 .cse18 .cse47 (select .cse48 .cse25) .cse10 .cse19 c_csum) (+ .cse33 .cse1 .cse2 .cse34 .cse35 .cse49 .cse3 5 .cse50 .cse23 .cse24 c_asum c_l))) (or .cse39 (= (+ (select .cse48 c_l) .cse14 .cse15 .cse16 .cse17 .cse18 .cse51 .cse19 c_csum) .cse12)) (forall ((v_k_127 Int)) (or (= (let ((.cse54 (store .cse59 v_k_127 (+ (select c_A v_k_127) 1)))) (let ((.cse52 (let ((.cse58 (+ v_k_127 1))) (store .cse54 .cse58 (+ 1 (select c_A .cse58)))))) (let ((.cse53 (let ((.cse57 (+ 3 v_k_127))) (store (let ((.cse56 (+ 2 v_k_127))) (store .cse52 .cse56 (+ (select c_A .cse56) 1))) .cse57 (+ (select c_A .cse57) 1))))) (+ (select .cse52 .cse28) .cse13 (select .cse53 .cse46) .cse43 .cse44 .cse17 .cse37 (select c_A (+ c_l 11)) (select .cse54 .cse25) .cse10 (select .cse53 .cse55) .cse19 c_csum)))) (+ .cse33 .cse1 .cse2 .cse34 .cse35 .cse49 .cse3 6 (select c_A (+ c_i 10)) .cse50 .cse23 .cse24 c_asum c_l)) (< v_k_127 .cse25) (< .cse27 v_k_127))) (= c_p c_k) (or .cse31 (= (+ c_asum c_l) c_csum) (not (= c_k c_l))) (or .cse39 (= (+ .cse33 .cse1 .cse2 .cse34 .cse35 .cse3 .cse50 .cse23 .cse24 c_asum c_l 4) (+ .cse16 .cse44 (select .cse45 .cse25) .cse17 .cse37 .cse18 .cse47 .cse51 .cse19 c_csum .cse20))) (or (< .cse25 c_N) (< c_p .cse25) (and (<= (+ c_p .cse42 .cse10 c_csum) (+ c_N 2 c_asum c_l)) (<= .cse41 (+ .cse42 .cse10 c_csum))))))))))) is different from false [2025-01-22 16:45:48,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:45:51,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:25,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:27,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:28,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:30,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:32,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:34,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:36,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:38,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:40,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:42,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:44,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:45,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:47,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:49,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:50,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:51,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:46:54,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:47:51,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:47:55,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:47:58,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:00,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:03,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:04,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:05,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:07,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:09,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:11,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:12,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:19,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:21,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:23,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:27,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:28,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:31,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:32,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:48:34,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:40,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:42,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:44,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:47,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:49,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:51,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:53,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:55,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:57,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:49:59,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:50:00,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:50:01,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:50:04,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:50:05,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-22 16:50:07,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-01-22 16:50:19,001 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 16:50:19,002 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 16:50:19,006 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-22 16:50:19,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-22 16:50:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 16:50:19,824 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 186 known predicates. [2025-01-22 16:50:19,826 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-01-22 16:50:19,826 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-22 16:50:19,826 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-22 16:50:19,826 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-22 16:50:19,830 INFO L422 BasicCegarLoop]: Path program histogram: [9, 2] [2025-01-22 16:50:19,831 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-22 16:50:19,831 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-22 16:50:19,839 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 16:50:19,840 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.01 04:50:19 BasicIcfg [2025-01-22 16:50:19,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-22 16:50:19,840 INFO L158 Benchmark]: Toolchain (without parser) took 875528.17ms. Allocated memory was 117.4MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 82.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2025-01-22 16:50:19,840 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 16:50:19,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.15ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 16:50:19,841 INFO L158 Benchmark]: Boogie Preprocessor took 14.46ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 80.0MB in the end (delta: 712.2kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 16:50:19,841 INFO L158 Benchmark]: RCFGBuilder took 198.55ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 69.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-22 16:50:19,841 INFO L158 Benchmark]: TraceAbstraction took 875289.94ms. Allocated memory was 117.4MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 69.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2025-01-22 16:50:19,841 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.18ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 19.15ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 14.46ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 80.0MB in the end (delta: 712.2kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 198.55ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 69.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 875289.94ms. Allocated memory was 117.4MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 69.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. 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: 8295, independent: 6807, independent conditional: 6441, independent unconditional: 366, dependent: 1488, dependent conditional: 1484, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7009, independent: 6807, independent conditional: 0, independent unconditional: 6807, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 316, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 316, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7009, independent: 6497, independent conditional: 0, independent unconditional: 6497, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 316, unknown conditional: 0, unknown unconditional: 316] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 310, Positive conditional cache size: 0, Positive unconditional cache size: 310, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 1286, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 72, Number of trivial persistent sets: 38, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8295, independent: 6807, independent conditional: 6441, independent unconditional: 366, dependent: 1488, dependent conditional: 1484, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7009, independent: 6807, independent conditional: 0, independent unconditional: 6807, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 316, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 316, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7009, independent: 6497, independent conditional: 0, independent unconditional: 6497, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 316, unknown conditional: 0, unknown unconditional: 316] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 310, Positive conditional cache size: 0, Positive unconditional cache size: 310, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 1286 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 186 known predicates. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 186 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 186 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 186 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 875.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 646.0s, 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: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 226.4s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1260 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1800 ConstructedInterpolants, 12 QuantifiedInterpolants, 32260 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1712 ConjunctsInSsa, 370 ConjunctsInUnsatCore, 28 InterpolantComputations, 3 PerfectInterpolantSequences, 2033/3578 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown