/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-29 20:14:45,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-29 20:14:45,432 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-29 20:14:45,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-29 20:14:45,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-29 20:14:45,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-29 20:14:45,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-29 20:14:45,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-29 20:14:45,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-29 20:14:45,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-29 20:14:45,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-29 20:14:45,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-29 20:14:45,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-29 20:14:45,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-29 20:14:45,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-29 20:14:45,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-29 20:14:45,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-29 20:14:45,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-29 20:14:45,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-29 20:14:45,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-29 20:14:45,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-29 20:14:45,710 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-29 20:14:45,711 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-29 20:14:45,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl [2025-01-29 20:14:45,713 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl' [2025-01-29 20:14:45,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-29 20:14:45,737 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-29 20:14:45,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-29 20:14:45,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-29 20:14:45,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-29 20:14:45,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,756 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-29 20:14:45,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-29 20:14:45,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-29 20:14:45,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-29 20:14:45,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-29 20:14:45,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-29 20:14:45,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-29 20:14:45,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-29 20:14:45,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-29 20:14:45,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/1) ... [2025-01-29 20:14:45,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-29 20:14:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-29 20:14:45,806 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-29 20:14:45,809 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-29 20:14:45,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-29 20:14:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-29 20:14:45,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-29 20:14:45,829 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-29 20:14:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-29 20:14:45,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-29 20:14:45,829 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-29 20:14:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-29 20:14:45,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-29 20:14:45,829 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-29 20:14:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-29 20:14:45,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-29 20:14:45,830 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-29 20:14:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-29 20:14:45,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-29 20:14:45,830 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-01-29 20:14:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-29 20:14:45,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-29 20:14:45,831 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-29 20:14:45,871 INFO L234 CfgBuilder]: Building ICFG [2025-01-29 20:14:45,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-29 20:14:45,969 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-29 20:14:45,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-29 20:14:45,980 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-29 20:14:45,980 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-29 20:14:45,980 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 08:14:45 BoogieIcfgContainer [2025-01-29 20:14:45,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-29 20:14:45,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-29 20:14:45,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-29 20:14:45,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-29 20:14:45,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.01 08:14:45" (1/2) ... [2025-01-29 20:14:45,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d6e7f4 and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 08:14:45, skipping insertion in model container [2025-01-29 20:14:45,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 08:14:45" (2/2) ... [2025-01-29 20:14:45,987 INFO L128 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2025-01-29 20:14:45,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-29 20:14:45,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG min-max-2.wvr.bpl that has 6 procedures, 43 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-29 20:14:46,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-29 20:14:46,052 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-29 20:14:46,082 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-29 20:14:46,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-29 20:14:46,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-29 20:14:46,085 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-29 20:14:46,087 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-29 20:14:46,132 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-29 20:14:46,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-29 20:14:46,149 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;@3f796c63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-29 20:14:46,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-29 20:14:46,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2025-01-29 20:14:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886606536] [2025-01-29 20:14:46,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:46,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-29 20:14:46,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-29 20:14:46,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:47,039 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-29 20:14:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886606536] [2025-01-29 20:14:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886606536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-29 20:14:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302996649] [2025-01-29 20:14:47,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:47,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-29 20:14:47,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:47,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-29 20:14:47,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-29 20:14:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:47,078 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:47,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:14:47,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:47,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-29 20:14:47,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2025-01-29 20:14:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227965384] [2025-01-29 20:14:47,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:47,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:48,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-29 20:14:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-29 20:14:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:48,101 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-29 20:14:48,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227965384] [2025-01-29 20:14:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227965384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-29 20:14:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011762] [2025-01-29 20:14:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-29 20:14:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-29 20:14:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-29 20:14:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:48,105 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:48,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-29 20:14:48,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:48,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:48,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-29 20:14:48,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:48,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2025-01-29 20:14:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516347238] [2025-01-29 20:14:48,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:48,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-29 20:14:48,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-29 20:14:48,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:48,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:48,605 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-29 20:14:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516347238] [2025-01-29 20:14:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516347238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-29 20:14:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693521040] [2025-01-29 20:14:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:48,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-29 20:14:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-29 20:14:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-29 20:14:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:48,606 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:48,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:14:48,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:48,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:48,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:48,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-29 20:14:48,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:48,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2025-01-29 20:14:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:48,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828304710] [2025-01-29 20:14:48,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:48,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-29 20:14:48,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-29 20:14:48,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:48,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:49,021 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-29 20:14:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828304710] [2025-01-29 20:14:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828304710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-29 20:14:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798531433] [2025-01-29 20:14:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:49,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-29 20:14:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:49,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-29 20:14:49,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-29 20:14:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:49,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:49,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:14:49,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:49,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-29 20:14:49,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2025-01-29 20:14:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:49,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282327308] [2025-01-29 20:14:49,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:49,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-29 20:14:49,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-29 20:14:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:49,379 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-29 20:14:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282327308] [2025-01-29 20:14:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282327308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-29 20:14:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462102460] [2025-01-29 20:14:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:49,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-29 20:14:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-29 20:14:49,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-29 20:14:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:49,380 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:14:49,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:49,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-29 20:14:49,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2025-01-29 20:14:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413362016] [2025-01-29 20:14:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:49,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-29 20:14:49,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-29 20:14:49,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:49,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:14:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413362016] [2025-01-29 20:14:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413362016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-29 20:14:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009689243] [2025-01-29 20:14:49,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:49,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-29 20:14:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-29 20:14:49,937 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-29 20:14:49,938 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-29 20:14:49,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-29 20:14:49,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-29 20:14:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:49,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-29 20:14:49,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-29 20:14:50,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-29 20:14:50,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-01-29 20:14:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:14:50,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-29 20:14:51,135 INFO L349 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2025-01-29 20:14:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 319 [2025-01-29 20:14:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:14:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009689243] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-29 20:14:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-29 20:14:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-01-29 20:14:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608382784] [2025-01-29 20:14:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:51,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-29 20:14:51,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:51,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-29 20:14:51,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-29 20:14:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:51,439 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:51,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:51,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:52,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-29 20:14:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-29 20:14:52,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 456365027, now seen corresponding path program 2 times [2025-01-29 20:14:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442378835] [2025-01-29 20:14:52,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-29 20:14:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:52,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-29 20:14:52,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-29 20:14:52,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-29 20:14:52,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:53,084 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-29 20:14:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:53,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442378835] [2025-01-29 20:14:53,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442378835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:53,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-29 20:14:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707861849] [2025-01-29 20:14:53,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:53,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-29 20:14:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:53,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-29 20:14:53,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-29 20:14:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:53,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:53,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 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-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-29 20:14:53,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:56,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-29 20:14:56,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:56,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 858758413, now seen corresponding path program 2 times [2025-01-29 20:14:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324678109] [2025-01-29 20:14:56,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-29 20:14:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:56,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-29 20:14:56,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-29 20:14:56,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-29 20:14:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:56,531 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-29 20:14:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324678109] [2025-01-29 20:14:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324678109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-29 20:14:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498563910] [2025-01-29 20:14:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:56,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-29 20:14:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:56,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-29 20:14:56,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-29 20:14:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:56,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:56,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:56,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-29 20:14:58,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:58,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1077796018, now seen corresponding path program 1 times [2025-01-29 20:14:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080975325] [2025-01-29 20:14:58,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:58,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-29 20:14:58,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-29 20:14:58,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:58,074 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-29 20:14:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080975325] [2025-01-29 20:14:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080975325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-29 20:14:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111433817] [2025-01-29 20:14:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:58,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-29 20:14:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:58,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-29 20:14:58,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-29 20:14:58,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:58,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:58,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-29 20:14:59,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:14:59,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:14:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1651596247, now seen corresponding path program 1 times [2025-01-29 20:14:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:14:59,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430836511] [2025-01-29 20:14:59,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-29 20:14:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:14:59,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-29 20:14:59,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-29 20:14:59,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:14:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:14:59,339 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-29 20:14:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:14:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430836511] [2025-01-29 20:14:59,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430836511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:14:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:14:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-29 20:14:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638369374] [2025-01-29 20:14:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:14:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-29 20:14:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:14:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-29 20:14:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-29 20:14:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:14:59,341 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:14:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:14:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-29 20:15:00,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1573363713, now seen corresponding path program 3 times [2025-01-29 20:15:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242966974] [2025-01-29 20:15:00,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-29 20:15:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:00,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-29 20:15:00,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-29 20:15:00,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-29 20:15:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:00,559 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-29 20:15:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242966974] [2025-01-29 20:15:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242966974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:15:00,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:15:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-29 20:15:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369684053] [2025-01-29 20:15:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:15:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-29 20:15:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:15:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-29 20:15:00,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-29 20:15:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:00,560 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:15:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:00,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:02,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-29 20:15:02,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:02,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1373041165, now seen corresponding path program 4 times [2025-01-29 20:15:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:02,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598788010] [2025-01-29 20:15:02,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-29 20:15:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:02,856 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-29 20:15:02,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-29 20:15:02,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-29 20:15:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-29 20:15:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598788010] [2025-01-29 20:15:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598788010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:15:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:15:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-29 20:15:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086239795] [2025-01-29 20:15:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:15:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-29 20:15:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:15:03,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-29 20:15:03,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-29 20:15:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:03,030 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:15:03,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:03,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-29 20:15:07,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:07,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2099486894, now seen corresponding path program 5 times [2025-01-29 20:15:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382827220] [2025-01-29 20:15:07,074 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-29 20:15:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:07,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-01-29 20:15:07,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-29 20:15:07,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-29 20:15:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:07,122 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-29 20:15:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382827220] [2025-01-29 20:15:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382827220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:15:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:15:07,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-29 20:15:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711851775] [2025-01-29 20:15:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:15:07,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-29 20:15:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:15:07,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-29 20:15:07,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-29 20:15:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:07,123 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:15:07,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:07,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-29 20:15:11,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:11,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1918103178, now seen corresponding path program 6 times [2025-01-29 20:15:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802233434] [2025-01-29 20:15:11,794 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-29 20:15:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:11,798 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-01-29 20:15:11,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-29 20:15:11,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-29 20:15:11,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:11,851 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-29 20:15:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802233434] [2025-01-29 20:15:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802233434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-29 20:15:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-29 20:15:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-29 20:15:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888752204] [2025-01-29 20:15:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-29 20:15:11,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-29 20:15:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:15:11,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-29 20:15:11,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-29 20:15:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:11,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:15:11,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:11,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:19,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-29 20:15:19,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1881806078, now seen corresponding path program 7 times [2025-01-29 20:15:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140431892] [2025-01-29 20:15:19,956 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-29 20:15:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:19,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-29 20:15:19,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-29 20:15:19,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:15:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:15:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140431892] [2025-01-29 20:15:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140431892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-29 20:15:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469413623] [2025-01-29 20:15:20,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-29 20:15:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-29 20:15:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-29 20:15:20,003 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-29 20:15:20,005 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-29 20:15:20,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-29 20:15:20,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-29 20:15:20,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-29 20:15:20,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:20,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-29 20:15:20,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-29 20:15:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:15:20,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-29 20:15:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-29 20:15:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469413623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-29 20:15:20,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-29 20:15:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-29 20:15:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220845116] [2025-01-29 20:15:20,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-29 20:15:20,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-29 20:15:20,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:15:20,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-29 20:15:20,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-29 20:15:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:20,131 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:15:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:20,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:15:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:15:34,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-29 20:15:34,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-29 20:15:34,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-29 20:15:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-29 20:15:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash -985234385, now seen corresponding path program 8 times [2025-01-29 20:15:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-29 20:15:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770463057] [2025-01-29 20:15:34,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-29 20:15:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-29 20:15:34,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-29 20:15:34,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-29 20:15:34,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-29 20:15:34,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-29 20:15:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-29 20:15:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770463057] [2025-01-29 20:15:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770463057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-29 20:15:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134952918] [2025-01-29 20:15:35,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-29 20:15:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-29 20:15:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-29 20:15:35,314 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-29 20:15:35,315 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-29 20:15:35,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-29 20:15:35,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-29 20:15:35,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-29 20:15:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-29 20:15:35,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-29 20:15:35,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-29 20:15:35,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-29 20:15:35,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-29 20:15:35,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-29 20:15:35,524 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 14 treesize of output 9 [2025-01-29 20:15:35,548 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 14 treesize of output 9 [2025-01-29 20:15:35,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-29 20:15:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-29 20:15:35,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-29 20:16:20,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-29 20:16:20,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32560 treesize of output 31336 [2025-01-29 20:16:22,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,867 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,878 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-29 20:16:22,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1124 treesize of output 1 [2025-01-29 20:16:22,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,883 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,894 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-29 20:16:22,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1124 treesize of output 1 [2025-01-29 20:16:22,899 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,923 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-01-29 20:16:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 4727 treesize of output 1 [2025-01-29 20:16:22,928 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-29 20:16:22,952 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-01-29 20:16:22,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 6493 treesize of output 1 [2025-01-29 20:16:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-29 20:16:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134952918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-29 20:16:29,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-29 20:16:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2025-01-29 20:16:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428401578] [2025-01-29 20:16:29,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-29 20:16:29,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-29 20:16:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-29 20:16:29,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-29 20:16:29,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=644, Unknown=20, NotChecked=0, Total=812 [2025-01-29 20:16:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:16:29,018 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-29 20:16:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 28 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-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-29 20:16:29,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-29 20:16:39,282 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-29 20:16:41,660 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-29 20:16:43,747 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-29 20:16:45,765 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-29 20:16:51,151 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-29 20:16:53,183 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-29 20:16:55,244 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-29 20:17:09,363 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-29 20:17:11,372 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-29 20:17:13,376 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-29 20:17:15,382 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-29 20:17:19,843 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-29 20:17:21,846 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-29 20:17:30,171 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-29 20:17:32,187 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-29 20:17:46,354 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-29 20:17:48,357 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-29 20:17:50,365 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-29 20:17:52,368 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-29 20:17:54,373 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-29 20:17:56,376 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-29 20:17:58,408 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-29 20:18:00,470 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-29 20:18:02,480 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-29 20:18:04,486 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-29 20:18:06,513 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-29 20:18:08,519 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-29 20:18:10,523 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-29 20:18:12,529 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-29 20:18:14,535 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-29 20:18:16,542 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-29 20:18:18,546 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-29 20:18:20,550 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-29 20:18:22,555 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-29 20:18:24,559 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-29 20:18:26,564 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-29 20:18:28,567 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-29 20:18:30,575 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-29 20:18:32,582 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-29 20:18:34,590 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-29 20:18:36,593 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-29 20:18:38,604 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-29 20:18:40,607 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-29 20:18:42,614 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-29 20:18:44,622 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-29 20:18:46,636 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-29 20:18:50,820 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-29 20:18:52,881 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-29 20:18:55,085 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-29 20:18:57,094 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-29 20:18:59,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:19:01,166 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-29 20:19:03,190 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-29 20:19:07,302 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-29 20:19:09,313 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-29 20:19:10,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:19:16,489 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-29 20:19:18,499 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-29 20:19:20,519 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-29 20:19:22,547 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-29 20:19:24,647 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-29 20:19:26,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:19:28,750 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-29 20:19:30,760 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-29 20:19:32,778 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-29 20:19:34,801 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-29 20:19:36,839 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-29 20:19:38,856 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-29 20:19:40,916 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-29 20:19:42,951 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-29 20:19:47,737 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-29 20:19:49,749 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-29 20:19:51,754 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-29 20:19:53,771 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-29 20:19:55,783 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-29 20:19:57,798 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-29 20:19:59,811 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-29 20:20:01,827 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-29 20:20:03,847 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-29 20:20:09,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:20:11,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:20:13,974 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-29 20:20:27,386 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-29 20:20:29,472 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-29 20:20:47,888 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-29 20:20:49,925 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-29 20:20:51,969 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-29 20:20:54,207 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-29 20:20:56,215 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-29 20:21:18,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:21:21,001 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-29 20:21:23,196 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-29 20:21:25,202 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-29 20:21:42,578 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-29 20:21:44,587 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-29 20:22:17,649 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-29 20:22:19,660 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-29 20:22:21,704 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-29 20:22:23,711 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-29 20:22:25,727 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-29 20:22:27,742 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-29 20:22:29,763 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-29 20:22:31,774 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-29 20:22:33,810 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-29 20:22:35,813 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-29 20:22:37,850 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-29 20:22:39,882 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-29 20:22:42,601 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-29 20:22:44,615 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-29 20:22:46,635 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-29 20:22:48,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:22:50,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select c_A c_l)) (.cse27 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2)))) (.cse8 (forall ((i Int)) (<= (select c_A i) c_min))) (.cse3 (+ (select c_A c_k) 1)) (.cse5 (+ c_k 1)) (.cse4 (select c_A c_i)) (.cse2 (+ c_l 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_15 Int)) (let ((.cse6 (store c_A c_k v_ArrVal_36))) (let ((.cse1 (store .cse6 c_l v_ArrVal_37))) (let ((.cse0 (select .cse1 v_i_15))) (or (< .cse0 (+ 2 (select (store (store .cse1 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse0) (< v_ArrVal_36 .cse3) (< .cse4 .cse0) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse6 c_l))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse7 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse7) (< c_min .cse7)))) (or .cse8 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2)))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse9 (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse9) (< c_min .cse9)))) c_v_assert (not (= .cse2 0)) (or (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_17 Int)) (let ((.cse12 (store c_A c_k v_ArrVal_36))) (let ((.cse10 (store .cse12 c_l v_ArrVal_37))) (let ((.cse11 (select (store (store .cse10 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (or (< (select .cse10 v_i_17) (+ 3 .cse11)) (< v_ArrVal_36 .cse3) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse12 c_l)) (< .cse4 (+ 2 .cse11))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_16 Int)) (let ((.cse15 (store c_A c_k v_ArrVal_36))) (let ((.cse13 (store .cse15 c_l v_ArrVal_37))) (let ((.cse14 (+ 2 (select (store (store .cse13 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< (select .cse13 v_i_16) .cse14) (< v_ArrVal_36 .cse3) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse15 c_l)) (< .cse4 .cse14)))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_18 Int)) (let ((.cse18 (store c_A c_k v_ArrVal_36))) (let ((.cse17 (store .cse18 c_l v_ArrVal_37))) (let ((.cse16 (select .cse17 v_i_18))) (or (< v_ArrVal_36 .cse3) (< .cse4 .cse16) (< v_k_12 .cse5) (< .cse16 (+ 2 (select (store (store .cse17 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< (+ v_ArrVal_37 1) (select .cse18 c_l)))))))) (< c_min .cse4)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse19 (select c_A i))) (or (< c_min .cse19) (< .cse19 (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2))))) (<= c_min c_max) (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse21 (store c_A c_l v_ArrVal_37))) (let ((.cse20 (+ 2 (select (store (store .cse21 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< c_min .cse20) (< (select .cse21 i) .cse20))))) (< (+ v_ArrVal_37 1) .cse22))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse3) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse25 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse24 (store .cse25 c_l v_ArrVal_37))) (let ((.cse23 (select .cse24 i))) (or (< c_min .cse23) (< .cse23 (+ 2 (select (store (store .cse24 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))))))) (< (+ v_ArrVal_37 1) (select .cse25 c_l))))) (< v_k_12 .cse5))))) (forall ((v_ArrVal_37 Int)) (let ((.cse26 (store c_A c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse26 i) c_min)) (< (+ v_ArrVal_37 1) .cse22) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse26 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))))))) .cse27 (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse29 (store c_A c_l v_ArrVal_37))) (let ((.cse28 (select .cse29 i))) (or (< .cse28 (+ 2 (select (store (store .cse29 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse28))))) (< (+ v_ArrVal_37 1) .cse22))) (forall ((v_ArrVal_36 Int)) (or (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse31 (store c_A c_k v_ArrVal_36))) (let ((.cse30 (store .cse31 c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse30 i) c_min)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse30 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (< (+ v_ArrVal_37 1) (select .cse31 c_l)))))) (< v_k_12 .cse5))) (< v_ArrVal_36 .cse3))) (or (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_subst_1 Int)) (let ((.cse34 (store c_A c_k v_ArrVal_36))) (let ((.cse33 (store .cse34 c_l v_ArrVal_37))) (let ((.cse32 (select (store (store .cse33 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (or (< v_ArrVal_36 .cse3) (< c_min (+ 2 .cse32)) (< (select .cse33 v_subst_1) (+ 3 .cse32)) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse34 c_l))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_subst_2 Int)) (let ((.cse37 (store c_A c_k v_ArrVal_36))) (let ((.cse36 (store .cse37 c_l v_ArrVal_37))) (let ((.cse35 (select .cse36 v_subst_2))) (or (< v_ArrVal_36 .cse3) (< .cse35 (+ 2 (select (store (store .cse36 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< v_k_12 .cse5) (< c_min .cse35) (< (+ v_ArrVal_37 1) (select .cse37 c_l))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_subst_3 Int)) (let ((.cse40 (store c_A c_k v_ArrVal_36))) (let ((.cse38 (store .cse40 c_l v_ArrVal_37))) (let ((.cse39 (+ 2 (select (store (store .cse38 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< (select .cse38 v_subst_3) .cse39) (< v_ArrVal_36 .cse3) (< c_min .cse39) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse40 c_l)))))))) (< .cse4 (+ c_min 1))) (or .cse27 .cse8) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse3) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse43 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse42 (store .cse43 c_l v_ArrVal_37))) (let ((.cse41 (+ 2 (select (store (store .cse42 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< c_min .cse41) (< (select .cse42 i) .cse41))))) (< (+ v_ArrVal_37 1) (select .cse43 c_l))))) (< v_k_12 .cse5))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_13 Int)) (let ((.cse47 (store c_A c_k v_ArrVal_36))) (let ((.cse44 (store .cse47 c_l v_ArrVal_37))) (let ((.cse45 (select (store (store .cse44 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (let ((.cse46 (+ 2 .cse45))) (or (< v_ArrVal_36 .cse3) (< (select .cse44 v_i_13) (+ 3 .cse45)) (< c_min .cse46) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse47 c_l)) (< .cse4 .cse46))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_14 Int)) (let ((.cse50 (store c_A c_k v_ArrVal_36))) (let ((.cse48 (store .cse50 c_l v_ArrVal_37))) (let ((.cse49 (+ 2 (select (store (store .cse48 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< v_ArrVal_36 .cse3) (< (select .cse48 v_i_14) .cse49) (< c_min .cse49) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse50 c_l)) (< .cse4 .cse49)))))) (<= 0 c_k) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse51 (select c_A i))) (or (< c_min .cse51) (< .cse51 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-29 20:23:08,665 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-29 20:23:10,667 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-29 20:23:12,670 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-29 20:23:14,677 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-29 20:23:16,678 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-29 20:23:18,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2)))) (.cse1 (+ (select c_A c_k) 1)) (.cse4 (+ c_l 1)) (.cse6 (+ c_k 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse0 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse0) (< c_min .cse0)))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse1) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse5 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse3 (store .cse5 c_l v_ArrVal_37))) (let ((.cse2 (select .cse3 i))) (or (< c_min .cse2) (< .cse2 (+ 2 (select (store (store .cse3 v_k_12 v_ArrVal_38) .cse4 v_ArrVal_39) 0))))))) (< (+ v_ArrVal_37 1) (select .cse5 c_l))))) (< v_k_12 .cse6))))) .cse7 (forall ((v_ArrVal_36 Int)) (or (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse9 (store c_A c_k v_ArrVal_36))) (let ((.cse8 (store .cse9 c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse8 i) c_min)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse8 v_k_12 v_ArrVal_38) .cse4 v_ArrVal_39) 0)))) (< (+ v_ArrVal_37 1) (select .cse9 c_l)))))) (< v_k_12 .cse6))) (< v_ArrVal_36 .cse1))) (or .cse7 (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse1) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse12 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse11 (store .cse12 c_l v_ArrVal_37))) (let ((.cse10 (+ 2 (select (store (store .cse11 v_k_12 v_ArrVal_38) .cse4 v_ArrVal_39) 0)))) (or (< c_min .cse10) (< (select .cse11 i) .cse10))))) (< (+ v_ArrVal_37 1) (select .cse12 c_l))))) (< v_k_12 .cse6))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse13 (select c_A i))) (or (< c_min .cse13) (< .cse13 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-29 20:23:20,698 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-29 20:23:22,703 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-29 20:23:24,705 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-29 20:23:26,716 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-29 20:23:28,717 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-29 20:23:30,777 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-29 20:23:32,791 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-29 20:23:34,798 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-29 20:23:36,819 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-29 20:23:38,838 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-29 20:23:41,031 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-29 20:23:43,059 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-29 20:23:45,064 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-29 20:23:47,066 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-29 20:23:49,076 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-29 20:23:51,089 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-29 20:23:53,091 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-29 20:23:55,093 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-29 20:23:57,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:23:59,102 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-29 20:24:01,162 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-29 20:24:03,170 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-29 20:24:05,189 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-29 20:24:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:24:09,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:24:33,827 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-29 20:24:35,839 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-29 20:24:38,741 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-29 20:24:40,774 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-29 20:25:30,888 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-29 20:25:32,893 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-29 20:25:34,909 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-29 20:25:36,936 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-29 20:26:19,850 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-29 20:26:21,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:26:24,014 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-29 20:27:04,835 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-29 20:27:06,856 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-29 20:27:08,873 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-29 20:27:11,018 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-29 20:27:13,026 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-29 20:27:47,626 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-29 20:27:49,630 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-29 20:27:51,642 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-29 20:27:53,721 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-29 20:27:55,722 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-29 20:27:57,724 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-29 20:27:59,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_l 1)) (.cse0 (select c_A c_l)) (.cse4 (+ c_k 1))) (and (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse0) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse2 (store c_A c_l v_ArrVal_37))) (let ((.cse1 (+ 2 (select (store (store .cse2 v_k_12 v_ArrVal_38) .cse3 v_ArrVal_39) 0)))) (or (< c_min .cse1) (< (select .cse2 i) .cse1))))))) (< v_k_12 .cse4))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (forall ((v_k_12 Int)) (or (< v_k_12 .cse4) (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse0) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse6 (store c_A c_l v_ArrVal_37))) (let ((.cse5 (select .cse6 i))) (or (< .cse5 (+ 2 (select (store (store .cse6 v_k_12 v_ArrVal_38) .cse3 v_ArrVal_39) 0))) (< c_min .cse5))))))))) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse7 (store c_A c_l v_ArrVal_37))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse7 v_k_12 v_ArrVal_38) .cse3 v_ArrVal_39) 0)))) (forall ((i Int)) (<= (select .cse7 i) c_min)) (< (+ v_ArrVal_37 1) .cse0)))) (< v_k_12 .cse4))))) is different from false [2025-01-29 20:28:01,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_l 1)) (.cse3 (select c_A c_l))) (and (forall ((v_ArrVal_39 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_39) 0) 2))) (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_37))) (let ((.cse0 (+ 2 (select (store (store .cse1 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< c_min .cse0) (< (select .cse1 i) .cse0))))) (< (+ v_ArrVal_37 1) .cse3))) (forall ((v_ArrVal_37 Int)) (let ((.cse4 (store c_A c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse4 i) c_min)) (< (+ v_ArrVal_37 1) .cse3) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse4 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))))))) (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse6 (store c_A c_l v_ArrVal_37))) (let ((.cse5 (select .cse6 i))) (or (< .cse5 (+ 2 (select (store (store .cse6 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse5))))) (< (+ v_ArrVal_37 1) .cse3))))) is different from false [2025-01-29 20:28:03,787 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-29 20:28:05,811 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-29 20:28:07,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-29 20:28:09,214 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-29 20:28:11,400 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-29 20:28:13,403 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-29 20:28:15,426 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-29 20:28:17,437 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-29 20:28:52,864 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] Received shutdown request... [2025-01-29 20:29:17,662 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-29 20:29:17,663 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-29 20:29:17,663 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-29 20:29:18,674 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-29 20:29:18,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-29 20:29:18,862 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2025-01-29 20:29:18,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2025-01-29 20:29:18,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-29 20:29:18,950 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-29 20:29:18,952 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-29 20:29:18,958 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1, 1, 1] [2025-01-29 20:29:18,961 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-29 20:29:18,961 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-29 20:29:18,963 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 08:29:18 BasicIcfg [2025-01-29 20:29:18,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-29 20:29:18,964 INFO L158 Benchmark]: Toolchain (without parser) took 873226.77ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 100.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2025-01-29 20:29:18,965 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-29 20:29:18,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.59ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 98.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-29 20:29:18,965 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 97.5MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-29 20:29:18,965 INFO L158 Benchmark]: RCFGBuilder took 203.25ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 88.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-29 20:29:18,965 INFO L158 Benchmark]: TraceAbstraction took 872981.42ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 87.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2025-01-29 20:29:18,966 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.22ms. Allocated memory is still 167.8MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 19.59ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 98.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 97.5MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 203.25ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 88.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 872981.42ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 87.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.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: 9481461, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 943584, dependent conditional: 943556, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8725463, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 187586, dependent conditional: 187558, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8725463, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 187586, dependent conditional: 187558, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 1647838, dependent conditional: 1647810, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 62042, independent unconditional: 8475067, dependent: 1647838, dependent conditional: 979430, dependent unconditional: 668408, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 62042, independent unconditional: 8475067, dependent: 1647838, dependent conditional: 979430, dependent unconditional: 668408, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2286, independent: 1623, independent conditional: 109, independent unconditional: 1514, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2286, independent: 1508, independent conditional: 0, independent unconditional: 1508, dependent: 778, dependent conditional: 0, dependent unconditional: 778, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 778, independent: 115, independent conditional: 109, independent unconditional: 6, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 778, independent: 115, independent conditional: 109, independent unconditional: 6, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12597, independent: 1506, independent conditional: 1440, independent unconditional: 66, dependent: 7013, dependent conditional: 6350, dependent unconditional: 663, unknown: 4078, unknown conditional: 4078, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10185715, independent: 8535486, independent conditional: 61933, independent unconditional: 8473553, dependent: 1647179, dependent conditional: 978799, dependent unconditional: 668380, unknown: 3050, unknown conditional: 1508, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 2286, Positive cache size: 1623, Positive conditional cache size: 109, Positive unconditional cache size: 1514, Negative cache size: 659, Negative conditional cache size: 631, Negative unconditional cache size: 28, Unknown cache size: 4, Unknown conditional cache size: 4, Unknown unconditional cache size: 0, Eliminated conditions: 9141703, Maximal queried relation: 15, Independence queries for same thread: 755998, Persistent sets #1 benchmarks: Persistent set computation time: 1.1s, Number of persistent set computation: 6162, Number of trivial persistent sets: 4521, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1772, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9481461, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 943584, dependent conditional: 943556, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8725463, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 187586, dependent conditional: 187558, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8725463, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 187586, dependent conditional: 187558, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 8535365, independent unconditional: 1744, dependent: 1647838, dependent conditional: 1647810, dependent unconditional: 28, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 62042, independent unconditional: 8475067, dependent: 1647838, dependent conditional: 979430, dependent unconditional: 668408, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10185715, independent: 8537109, independent conditional: 62042, independent unconditional: 8475067, dependent: 1647838, dependent conditional: 979430, dependent unconditional: 668408, unknown: 768, unknown conditional: 768, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2286, independent: 1623, independent conditional: 109, independent unconditional: 1514, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2286, independent: 1508, independent conditional: 0, independent unconditional: 1508, dependent: 778, dependent conditional: 0, dependent unconditional: 778, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 778, independent: 115, independent conditional: 109, independent unconditional: 6, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 778, independent: 115, independent conditional: 109, independent unconditional: 6, dependent: 659, dependent conditional: 631, dependent unconditional: 28, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12597, independent: 1506, independent conditional: 1440, independent unconditional: 66, dependent: 7013, dependent conditional: 6350, dependent unconditional: 663, unknown: 4078, unknown conditional: 4078, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10185715, independent: 8535486, independent conditional: 61933, independent unconditional: 8473553, dependent: 1647179, dependent conditional: 978799, dependent unconditional: 668380, unknown: 3050, unknown conditional: 1508, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 2286, Positive cache size: 1623, Positive conditional cache size: 109, Positive unconditional cache size: 1514, Negative cache size: 659, Negative conditional cache size: 631, Negative unconditional cache size: 28, Unknown cache size: 4, Unknown conditional cache size: 4, Unknown unconditional cache size: 0, Eliminated conditions: 9141703, Maximal queried relation: 15, Independence queries for same thread: 755998 - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 11 procedures, 75 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 872.8s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 814.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 845 ConstructedInterpolants, 34 QuantifiedInterpolants, 11338 SizeOfPredicates, 22 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 17/58 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