/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-30 00:53:53,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-30 00:53:53,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-30 00:53:53,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-30 00:53:53,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-30 00:53:53,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-30 00:53:53,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-30 00:53:53,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-30 00:53:53,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-30 00:53:53,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-30 00:53:53,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-30 00:53:53,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-30 00:53:53,211 INFO L153 SettingsManager]: * Use SBE=true [2025-01-30 00:53:53,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-30 00:53:53,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-30 00:53:53,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:53:53,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-30 00:53:53,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-30 00:53:53,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-30 00:53:53,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-30 00:53:53,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-30 00:53:53,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-30 00:53:53,423 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-30 00:53:53,425 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-30 00:53:53,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl [2025-01-30 00:53:53,426 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2025-01-30 00:53:53,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-30 00:53:53,445 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-30 00:53:53,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-30 00:53:53,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-30 00:53:53,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-30 00:53:53,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,462 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-30 00:53:53,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-30 00:53:53,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-30 00:53:53,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-30 00:53:53,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-30 00:53:53,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-30 00:53:53,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-30 00:53:53,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-30 00:53:53,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-30 00:53:53,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/1) ... [2025-01-30 00:53:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:53:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:53:53,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-30 00:53:53,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-30 00:53:53,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-30 00:53:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-30 00:53:53,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-30 00:53:53,530 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-30 00:53:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-30 00:53:53,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-30 00:53:53,530 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-30 00:53:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-30 00:53:53,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-30 00:53:53,530 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-30 00:53:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-30 00:53:53,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-30 00:53:53,530 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-30 00:53:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-30 00:53:53,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-30 00:53:53,532 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-30 00:53:53,570 INFO L234 CfgBuilder]: Building ICFG [2025-01-30 00:53:53,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-30 00:53:53,658 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-30 00:53:53,658 INFO L283 CfgBuilder]: Performing block encoding [2025-01-30 00:53:53,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-30 00:53:53,672 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-30 00:53:53,673 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:53:53 BoogieIcfgContainer [2025-01-30 00:53:53,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-30 00:53:53,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-30 00:53:53,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-30 00:53:53,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-30 00:53:53,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:53:53" (1/2) ... [2025-01-30 00:53:53,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc590d1 and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:53:53, skipping insertion in model container [2025-01-30 00:53:53,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:53:53" (2/2) ... [2025-01-30 00:53:53,679 INFO L128 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2025-01-30 00:53:53,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-30 00:53:53,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG min-max-dec.wvr.bpl that has 5 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-30 00:53:53,692 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-30 00:53:53,731 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-30 00:53:53,762 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:53:53,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-30 00:53:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:53:53,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-30 00:53:53,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-30 00:53:53,812 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-30 00:53:53,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-30 00:53:53,833 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;@12383dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:53:53,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-30 00:53:54,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:53:54,343 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:53:54,343 INFO L139 ounterexampleChecker]: Examining path program with hash -1797045447, occurence #1 [2025-01-30 00:53:54,344 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:53:54,344 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:53:54,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:53:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2025-01-30 00:53:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:53:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3796457] [2025-01-30 00:53:54,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:53:54,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-30 00:53:54,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-30 00:53:54,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:53:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3796457] [2025-01-30 00:53:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3796457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:53:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:53:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:53:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483397639] [2025-01-30 00:53:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:53:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:53:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:53:54,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:53:54,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:53:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:54,621 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:53:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:53:54,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-30 00:53:55,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:53:55,138 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:53:55,138 INFO L139 ounterexampleChecker]: Examining path program with hash 1931053101, occurence #1 [2025-01-30 00:53:55,138 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:53:55,138 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:53:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:53:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2025-01-30 00:53:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:53:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859300305] [2025-01-30 00:53:55,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:53:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:53:55,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:53:55,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:55,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:53:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859300305] [2025-01-30 00:53:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859300305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:53:55,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:53:55,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:53:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408937619] [2025-01-30 00:53:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:53:55,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:53:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:53:55,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:53:55,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:53:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,196 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:53:55,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:53:55,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-30 00:53:55,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:53:55,439 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:53:55,439 INFO L139 ounterexampleChecker]: Examining path program with hash 1234064476, occurence #1 [2025-01-30 00:53:55,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:53:55,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:53:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:53:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2025-01-30 00:53:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:53:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420051301] [2025-01-30 00:53:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:53:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:53:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:53:55,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:55,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:53:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420051301] [2025-01-30 00:53:55,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420051301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:53:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:53:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:53:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550461966] [2025-01-30 00:53:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:53:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:53:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:53:55,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:53:55,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:53:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,505 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:53:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 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-30 00:53:55,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-30 00:53:55,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:53:55,735 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:53:55,735 INFO L139 ounterexampleChecker]: Examining path program with hash -1918427306, occurence #1 [2025-01-30 00:53:55,735 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:53:55,735 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:53:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:53:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2025-01-30 00:53:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:53:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316762948] [2025-01-30 00:53:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:53:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:53:55,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:53:55,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:55,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:53:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316762948] [2025-01-30 00:53:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316762948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:53:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:53:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:53:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638128961] [2025-01-30 00:53:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:53:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:53:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:53:55,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:53:55,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:53:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:55,783 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:53:55,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 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-30 00:53:55,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:55,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:55,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:56,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-30 00:53:56,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:53:56,023 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:53:56,023 INFO L139 ounterexampleChecker]: Examining path program with hash -2085922393, occurence #1 [2025-01-30 00:53:56,023 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:53:56,023 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:53:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:53:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2025-01-30 00:53:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:53:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884175953] [2025-01-30 00:53:56,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:53:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-30 00:53:56,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-30 00:53:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:56,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:53:56,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884175953] [2025-01-30 00:53:56,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884175953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:53:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906283118] [2025-01-30 00:53:56,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:53:56,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:53:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:53:56,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:53:56,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-30 00:53:56,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-30 00:53:56,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-30 00:53:56,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:53:56,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:53:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-30 00:53:56,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:53:56,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:53:56,453 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-30 00:53:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:56,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:53:57,259 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-30 00:53:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2025-01-30 00:53:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:53:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906283118] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-30 00:53:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:53:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-01-30 00:53:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538862623] [2025-01-30 00:53:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:53:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-30 00:53:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:53:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-30 00:53:57,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-30 00:53:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:57,261 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:53:57,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:53:57,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:53:57,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:57,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:57,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:53:57,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:53:59,474 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-30 00:54:01,852 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-30 00:54:03,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:54:05,886 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-30 00:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:06,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-30 00:54:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:54:06,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:06,727 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:06,728 INFO L139 ounterexampleChecker]: Examining path program with hash -1276218355, occurence #1 [2025-01-30 00:54:06,728 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:06,728 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1344569481, now seen corresponding path program 2 times [2025-01-30 00:54:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85189375] [2025-01-30 00:54:06,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:54:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:06,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-30 00:54:06,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-30 00:54:06,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:54:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85189375] [2025-01-30 00:54:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85189375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:54:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:54:06,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-30 00:54:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421587848] [2025-01-30 00:54:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:54:06,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-30 00:54:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:06,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-30 00:54:06,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-30 00:54:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:06,966 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:07,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-30 00:54:07,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:07,954 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:07,954 INFO L139 ounterexampleChecker]: Examining path program with hash -42887225, occurence #1 [2025-01-30 00:54:07,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:07,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2025-01-30 00:54:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940611649] [2025-01-30 00:54:07,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:54:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:07,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-30 00:54:07,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-30 00:54:07,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:54:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940611649] [2025-01-30 00:54:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940611649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:54:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:54:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:54:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321933447] [2025-01-30 00:54:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:54:07,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:54:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:07,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:54:07,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:54:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:07,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:07,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-30 00:54:08,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:08,346 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:08,346 INFO L139 ounterexampleChecker]: Examining path program with hash 1660810781, occurence #1 [2025-01-30 00:54:08,346 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:08,346 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2025-01-30 00:54:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709935668] [2025-01-30 00:54:08,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:54:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:08,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-30 00:54:08,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-30 00:54:08,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:54:08,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:08,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709935668] [2025-01-30 00:54:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709935668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:54:08,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:54:08,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:54:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526093348] [2025-01-30 00:54:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:54:08,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:54:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:08,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:54:08,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:54:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:08,370 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:08,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-30 00:54:08,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:08,577 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:08,577 INFO L139 ounterexampleChecker]: Examining path program with hash 796147212, occurence #1 [2025-01-30 00:54:08,577 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:08,577 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 3 times [2025-01-30 00:54:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328528468] [2025-01-30 00:54:08,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:54:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:08,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-30 00:54:08,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-01-30 00:54:08,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-30 00:54:08,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:08,691 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-30 00:54:08,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:08,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328528468] [2025-01-30 00:54:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328528468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:54:08,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:54:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-30 00:54:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808076424] [2025-01-30 00:54:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:54:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-30 00:54:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:08,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-30 00:54:08,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-30 00:54:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:08,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:08,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:09,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-30 00:54:09,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:09,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:09,818 INFO L139 ounterexampleChecker]: Examining path program with hash -981970382, occurence #1 [2025-01-30 00:54:09,818 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:09,818 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:09,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1126112921, now seen corresponding path program 4 times [2025-01-30 00:54:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37009953] [2025-01-30 00:54:09,819 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:54:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:09,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-30 00:54:09,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-30 00:54:09,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-30 00:54:09,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-30 00:54:09,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37009953] [2025-01-30 00:54:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37009953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:54:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:54:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:54:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608125613] [2025-01-30 00:54:09,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:54:09,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 00:54:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:09,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 00:54:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-30 00:54:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:09,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 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-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:09,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:09,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-30 00:54:10,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:10,436 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:10,436 INFO L139 ounterexampleChecker]: Examining path program with hash 54079419, occurence #1 [2025-01-30 00:54:10,436 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:54:10,436 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:10,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 655758623, now seen corresponding path program 5 times [2025-01-30 00:54:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774723716] [2025-01-30 00:54:10,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:54:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:10,440 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-30 00:54:10,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-30 00:54:10,443 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:54:10,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:10,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774723716] [2025-01-30 00:54:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774723716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:54:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680518715] [2025-01-30 00:54:10,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:54:10,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:54:10,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:54:10,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:54:10,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-30 00:54:10,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-30 00:54:10,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-30 00:54:10,516 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:54:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:10,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-30 00:54:10,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:54:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:10,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:54:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680518715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:54:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 00:54:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-30 00:54:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424584865] [2025-01-30 00:54:10,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 00:54:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-30 00:54:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:10,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-30 00:54:10,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-30 00:54:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:10,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:10,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:10,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:11,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-30 00:54:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:54:11,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 00:54:11,442 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:54:11,442 INFO L139 ounterexampleChecker]: Examining path program with hash 54079419, occurence #2 [2025-01-30 00:54:11,442 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:54:11,442 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-30 00:54:11,443 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:54:11,443 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-01-30 00:54:11,443 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:54:11,443 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-01-30 00:54:11,443 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:54:11,443 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-01-30 00:54:11,443 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:54:11,443 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-01-30 00:54:11,443 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:54:11,443 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:54:11,443 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:54:11,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:54:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1439485347, now seen corresponding path program 6 times [2025-01-30 00:54:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:54:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023637526] [2025-01-30 00:54:11,444 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:54:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:54:11,448 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-01-30 00:54:11,461 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-30 00:54:11,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-30 00:54:11,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-30 00:54:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:54:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023637526] [2025-01-30 00:54:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023637526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:54:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572879320] [2025-01-30 00:54:11,649 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:54:11,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:54:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:54:11,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:54:11,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-30 00:54:11,669 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-01-30 00:54:11,679 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-30 00:54:11,679 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-30 00:54:11,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:54:11,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-30 00:54:11,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:54:11,766 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-30 00:54:11,891 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2025-01-30 00:54:11,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 73 [2025-01-30 00:54:12,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-30 00:54:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:54:12,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:54:14,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((l Int)) (or (< l (+ c_j 1)) (forall ((v_ArrVal_17 Int)) (< c_min (+ (select (store c_A l v_ArrVal_17) 0) 2))))) is different from false [2025-01-30 00:54:31,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:54:31,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 3227 treesize of output 3415 [2025-01-30 00:54:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-30 00:54:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572879320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:54:47,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 00:54:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 28 [2025-01-30 00:54:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530549235] [2025-01-30 00:54:47,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 00:54:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-30 00:54:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:54:47,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-30 00:54:47,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=642, Unknown=7, NotChecked=52, Total=812 [2025-01-30 00:54:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:47,369 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:54:47,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:54:47,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:54:50,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-30 00:54:52,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-30 00:54:54,919 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 [0] [2025-01-30 00:54:57,583 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-30 00:55:00,356 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 [0] [2025-01-30 00:55:02,449 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 [0] [2025-01-30 00:55:17,530 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-30 00:55:19,539 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-30 00:55:21,558 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-30 00:55:23,574 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-30 00:55:33,732 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-30 00:55:35,741 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-30 00:55:37,762 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-30 00:55:39,770 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-30 00:55:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:55:43,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-30 00:55:54,907 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-30 00:55:56,921 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-30 00:55:58,929 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-30 00:56:00,937 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-30 00:56:02,964 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-30 00:56:04,969 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-30 00:56:06,988 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-30 00:56:08,998 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-30 00:56:11,025 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-30 00:56:13,034 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-30 00:56:15,048 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-30 00:56:17,060 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-30 00:56:19,091 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-30 00:56:21,103 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-30 00:56:23,115 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-30 00:56:25,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:56:27,143 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-30 00:56:29,154 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-30 00:56:31,177 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-30 00:56:33,202 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-30 00:56:35,251 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-30 00:56:37,270 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-30 00:57:25,935 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-30 00:57:44,629 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-30 00:57:48,248 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-30 00:57:50,279 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-30 00:57:52,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:57:54,407 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-30 00:58:15,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 [0] [2025-01-30 00:58:17,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 [0] [2025-01-30 00:58:20,314 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 [0] [2025-01-30 00:59:08,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-30 00:59:48,947 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-30 00:59:51,521 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 [0] [2025-01-30 00:59:53,648 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 [0] [2025-01-30 00:59:57,439 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 [0] [2025-01-30 00:59:59,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-30 01:00:02,278 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-30 01:00:04,285 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-30 01:00:06,430 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-30 01:00:08,444 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-30 01:00:10,733 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 [0] [2025-01-30 01:00:12,803 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-30 01:00:14,807 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-30 01:00:16,810 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-30 01:00:18,899 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-30 01:00:22,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-30 01:01:23,767 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-30 01:01:38,214 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-30 01:01:40,226 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-30 01:01:42,231 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-30 01:01:44,237 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-30 01:01:46,254 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-30 01:02:59,066 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-30 01:03:01,131 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-30 01:03:02,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 01:03:06,965 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-30 01:03:09,057 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-30 01:03:11,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_j)) (.cse2 (< c_min (+ c_max 2))) (.cse0 (+ c_j 1))) (and (or (forall ((i Int)) (< (select c_A i) (+ c_min 1))) (forall ((v_ArrVal_17 Int) (l Int)) (or (< c_min (+ (select (store c_A l v_ArrVal_17) 0) 2)) (< l .cse0)))) (or (< c_l .cse1) .cse2) (or (< c_N .cse1) .cse2) (forall ((l Int)) (or (forall ((v_ArrVal_17 Int) (i Int)) (let ((.cse3 (select c_A i))) (or (< c_min .cse3) (< .cse3 (+ (select (store c_A l v_ArrVal_17) 0) 2))))) (< l .cse0))) (or c_v_assert (< c_N .cse0)) (forall ((l Int)) (or (< l .cse0) (forall ((v_ArrVal_17 Int) (i Int)) (let ((.cse4 (+ (select (store c_A l v_ArrVal_17) 0) 2))) (or (< c_min .cse4) (< (select c_A i) .cse4)))))))) is different from false [2025-01-30 01:03:36,255 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-30 01:03:56,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 01:03:58,097 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-30 01:04:21,297 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-30 01:04:24,355 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-30 01:04:52,751 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-30 01:05:10,108 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-30 01:05:14,432 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-30 01:05:16,482 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-30 01:05:18,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 01:05:21,143 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-30 01:05:23,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 01:05:25,165 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-30 01:05:27,252 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-30 01:05:29,269 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-30 01:05:32,246 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-30 01:05:34,255 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-30 01:06:03,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-30 01:06:05,418 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-30 01:06:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-01-30 01:06:06,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-30 01:06:06,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 01:06:06,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 01:06:06,367 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:06:06,367 INFO L139 ounterexampleChecker]: Examining path program with hash -564739063, occurence #1 [2025-01-30 01:06:06,367 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:06:06,367 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:06:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:06:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash -769539999, now seen corresponding path program 7 times [2025-01-30 01:06:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:06:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254987411] [2025-01-30 01:06:06,368 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 01:06:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:06:06,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-30 01:06:06,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 01:06:06,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:06:06,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:06:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:06:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:06:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254987411] [2025-01-30 01:06:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254987411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 01:06:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368439006] [2025-01-30 01:06:06,449 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 01:06:06,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 01:06:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 01:06:06,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 01:06:06,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-30 01:06:06,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-30 01:06:06,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 01:06:06,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:06:06,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:06:06,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-30 01:06:06,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 01:06:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:06:06,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 01:06:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:06:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368439006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 01:06:06,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 01:06:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-01-30 01:06:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117819523] [2025-01-30 01:06:06,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 01:06:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-30 01:06:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:06:06,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-30 01:06:06,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-30 01:06:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:06:06,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:06:06,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 01:06:06,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2025-01-30 01:06:06,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 01:06:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 01:06:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:06:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-01-30 01:06:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-30 01:06:08,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-30 01:06:08,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-30 01:06:08,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-30 01:06:08,444 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:06:08,445 INFO L139 ounterexampleChecker]: Examining path program with hash -564739063, occurence #2 [2025-01-30 01:06:08,445 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 01:06:08,445 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-30 01:06:08,445 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 01:06:08,445 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-01-30 01:06:08,445 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 01:06:08,445 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-01-30 01:06:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:06:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash 903260752, now seen corresponding path program 1 times [2025-01-30 01:06:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-30 01:06:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039403243] [2025-01-30 01:06:08,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:06:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:06:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-30 01:06:08,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-30 01:06:08,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:06:08,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:06:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:06:08,932 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-01-30 01:06:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039403243] [2025-01-30 01:06:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039403243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 01:06:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1227058853] [2025-01-30 01:06:08,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:06:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:06:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-30 01:06:08,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-30 01:06:08,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:06:08,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:06:08,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-30 01:06:08,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 01:06:09,067 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-30 01:06:09,267 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2025-01-30 01:06:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 89 Received shutdown request... [2025-01-30 01:08:26,884 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 01:08:26,888 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 01:08:27,029 WARN L228 SmtUtils]: Removed 633 from assertion stack [2025-01-30 01:08:27,030 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2025-01-30 01:08:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2025-01-30 01:08:27,030 WARN L596 AbstractCegarLoop]: Verification canceled: while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. [2025-01-30 01:08:27,031 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-30 01:08:27,031 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-30 01:08:27,031 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-30 01:08:27,031 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-30 01:08:27,036 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2025-01-30 01:08:27,038 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-30 01:08:27,038 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-30 01:08:27,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-30 01:08:27,064 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:08:27 BasicIcfg [2025-01-30 01:08:27,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-30 01:08:27,065 INFO L158 Benchmark]: Toolchain (without parser) took 873619.66ms. Allocated memory was 167.8MB in the beginning and 931.1MB in the end (delta: 763.4MB). Free memory was 99.6MB in the beginning and 437.3MB in the end (delta: -337.7MB). Peak memory consumption was 531.4MB. Max. memory is 16.0GB. [2025-01-30 01:08:27,065 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:08:27,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.07ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:08:27,065 INFO L158 Benchmark]: Boogie Preprocessor took 18.13ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 97.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:08:27,065 INFO L158 Benchmark]: RCFGBuilder took 190.27ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 83.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2025-01-30 01:08:27,066 INFO L158 Benchmark]: TraceAbstraction took 873389.81ms. Allocated memory was 167.8MB in the beginning and 931.1MB in the end (delta: 763.4MB). Free memory was 83.0MB in the beginning and 437.3MB in the end (delta: -354.3MB). Peak memory consumption was 514.6MB. Max. memory is 16.0GB. [2025-01-30 01:08:27,066 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.21ms. Allocated memory is still 167.8MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 17.07ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 18.13ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 97.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 190.27ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 83.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 873389.81ms. Allocated memory was 167.8MB in the beginning and 931.1MB in the end (delta: 763.4MB). Free memory was 83.0MB in the beginning and 437.3MB in the end (delta: -354.3MB). Peak memory consumption was 514.6MB. 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: 370999, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 58817, dependent conditional: 58797, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322554, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 10372, dependent conditional: 10352, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 322554, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 10372, dependent conditional: 10352, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 88448, dependent conditional: 88428, dependent unconditional: 20, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 6928, independent unconditional: 304993, dependent: 88448, dependent conditional: 60892, dependent unconditional: 27556, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 6928, independent unconditional: 304993, dependent: 88448, dependent conditional: 60892, dependent unconditional: 27556, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1323, independent: 868, independent conditional: 120, independent unconditional: 748, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1323, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 578, dependent conditional: 0, dependent unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 578, independent: 123, independent conditional: 120, independent unconditional: 3, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 578, independent: 123, independent conditional: 120, independent unconditional: 3, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16440, independent: 2266, independent conditional: 2242, independent unconditional: 25, dependent: 8070, dependent conditional: 7484, dependent unconditional: 586, unknown: 6104, unknown conditional: 6104, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 400653, independent: 311053, independent conditional: 6808, independent unconditional: 304245, dependent: 87999, dependent conditional: 60463, dependent unconditional: 27536, unknown: 1601, unknown conditional: 833, unknown unconditional: 768] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 869, Positive conditional cache size: 121, Positive unconditional cache size: 748, Negative cache size: 449, Negative conditional cache size: 429, Negative unconditional cache size: 20, Unknown cache size: 6, Unknown conditional cache size: 6, Unknown unconditional cache size: 0, Eliminated conditions: 331725, Maximal queried relation: 13, Independence queries for same thread: 48445, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 553, Number of trivial persistent sets: 407, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 824, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370999, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 58817, dependent conditional: 58797, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322554, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 10372, dependent conditional: 10352, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 322554, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 10372, dependent conditional: 10352, dependent unconditional: 20, unknown: 261, unknown conditional: 261, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 311117, independent unconditional: 804, dependent: 88448, dependent conditional: 88428, dependent unconditional: 20, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 6928, independent unconditional: 304993, dependent: 88448, dependent conditional: 60892, dependent unconditional: 27556, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400653, independent: 311921, independent conditional: 6928, independent unconditional: 304993, dependent: 88448, dependent conditional: 60892, dependent unconditional: 27556, unknown: 284, unknown conditional: 284, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1323, independent: 868, independent conditional: 120, independent unconditional: 748, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1323, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 578, dependent conditional: 0, dependent unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 578, independent: 123, independent conditional: 120, independent unconditional: 3, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 578, independent: 123, independent conditional: 120, independent unconditional: 3, dependent: 449, dependent conditional: 429, dependent unconditional: 20, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16440, independent: 2266, independent conditional: 2242, independent unconditional: 25, dependent: 8070, dependent conditional: 7484, dependent unconditional: 586, unknown: 6104, unknown conditional: 6104, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 400653, independent: 311053, independent conditional: 6808, independent unconditional: 304245, dependent: 87999, dependent conditional: 60463, dependent unconditional: 27536, unknown: 1601, unknown conditional: 833, unknown unconditional: 768] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 869, Positive conditional cache size: 121, Positive unconditional cache size: 748, Negative cache size: 449, Negative conditional cache size: 429, Negative unconditional cache size: 20, Unknown cache size: 6, Unknown conditional cache size: 6, Unknown unconditional cache size: 0, Eliminated conditions: 331725, Maximal queried relation: 13, Independence queries for same thread: 48445 - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4751 for 135067ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 56 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 873.2s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 695.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 250, 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.1s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 513 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 628 ConstructedInterpolants, 24 QuantifiedInterpolants, 7570 SizeOfPredicates, 26 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 15/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 138584, ConditionCalculationTime [ms]: 34, ConditionCalculations: 5, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown