/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/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 11:56:45,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 11:56:45,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 11:56:45,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 11:56:45,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 11:56:45,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 11:56:45,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 11:56:45,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 11:56:45,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 11:56:45,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 11:56:45,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 11:56:45,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:56:45,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 11:56:45,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:56:45,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 11:56:45,950 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 11:56:45,950 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-04-25 11:56:46,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 11:56:46,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 11:56:46,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 11:56:46,163 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 11:56:46,165 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 11:56:46,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2025-04-25 11:56:46,166 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2025-04-25 11:56:46,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 11:56:46,185 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 11:56:46,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 11:56:46,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 11:56:46,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 11:56:46,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,214 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 11:56:46,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 11:56:46,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 11:56:46,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 11:56:46,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 11:56:46,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 11:56:46,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 11:56:46,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 11:56:46,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 11:56:46,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/1) ... [2025-04-25 11:56:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:56:46,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:46,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 11:56:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 11:56:46,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 11:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 11:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 11:56:46,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 11:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 11:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 11:56:46,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 11:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 11:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 11:56:46,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-25 11:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 11:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 11:56:46,283 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 11:56:46,316 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 11:56:46,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 11:56:46,407 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 11:56:46,407 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 11:56:46,425 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 11:56:46,425 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 11:56:46,426 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 11:56:46 BoogieIcfgContainer [2025-04-25 11:56:46,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 11:56:46,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 11:56:46,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 11:56:46,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 11:56:46,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:56:46" (1/2) ... [2025-04-25 11:56:46,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a487bc8 and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 11:56:46, skipping insertion in model container [2025-04-25 11:56:46,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 11:56:46" (2/2) ... [2025-04-25 11:56:46,434 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2025-04-25 11:56:46,446 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 11:56:46,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-array-sum.wvr.bpl that has 4 procedures, 26 locations, 26 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-25 11:56:46,449 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 11:56:46,501 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 11:56:46,533 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 11:56:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 11:56:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:46,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 11:56:46,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 11:56:46,577 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 11:56:46,588 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 11:56:46,593 INFO L340 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;@145b4bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 11:56:46,593 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 11:56:46,645 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:46,645 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:46,645 INFO L139 ounterexampleChecker]: Examining path program with hash -78949050, occurence #1 [2025-04-25 11:56:46,645 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:46,645 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:46,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1235333716, now seen corresponding path program 1 times [2025-04-25 11:56:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:46,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783398499] [2025-04-25 11:56:46,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:46,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 11:56:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 11:56:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:47,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:47,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783398499] [2025-04-25 11:56:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783398499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:56:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:56:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 11:56:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207561515] [2025-04-25 11:56:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:56:47,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 11:56:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 11:56:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 11:56:47,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,085 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:47,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-04-25 11:56:47,087 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 11:56:47,180 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:47,180 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:47,180 INFO L139 ounterexampleChecker]: Examining path program with hash -620013059, occurence #1 [2025-04-25 11:56:47,180 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:47,180 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:47,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash -142082062, now seen corresponding path program 1 times [2025-04-25 11:56:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:47,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435717927] [2025-04-25 11:56:47,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:47,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-25 11:56:47,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 11:56:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:47,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435717927] [2025-04-25 11:56:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435717927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:56:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:56:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 11:56:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245248130] [2025-04-25 11:56:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:56:47,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 11:56:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:47,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 11:56:47,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 11:56:47,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,231 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:47,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-04-25 11:56:47,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 11:56:47,314 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:47,314 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:47,314 INFO L139 ounterexampleChecker]: Examining path program with hash 1724434253, occurence #1 [2025-04-25 11:56:47,314 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:47,314 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:47,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash 628818342, now seen corresponding path program 1 times [2025-04-25 11:56:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:47,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554602807] [2025-04-25 11:56:47,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:47,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 11:56:47,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 11:56:47,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:47,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:47,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554602807] [2025-04-25 11:56:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554602807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:56:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:56:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 11:56:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151521386] [2025-04-25 11:56:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:56:47,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 11:56:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:47,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 11:56:47,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 11:56:47,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,367 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:47,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-04-25 11:56:47,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 11:56:47,431 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:47,431 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:47,431 INFO L139 ounterexampleChecker]: Examining path program with hash -945808934, occurence #1 [2025-04-25 11:56:47,431 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:47,431 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:47,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1960317976, now seen corresponding path program 1 times [2025-04-25 11:56:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:47,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691576875] [2025-04-25 11:56:47,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:47,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-25 11:56:47,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 11:56:47,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:47,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691576875] [2025-04-25 11:56:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691576875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:56:47,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:56:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 11:56:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681853686] [2025-04-25 11:56:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:56:47,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 11:56:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:47,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 11:56:47,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 11:56:47,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,476 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:47,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-04-25 11:56:47,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:47,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:47,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 11:56:47,564 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:47,564 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:47,564 INFO L139 ounterexampleChecker]: Examining path program with hash -379520371, occurence #1 [2025-04-25 11:56:47,564 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:47,564 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:47,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -211403052, now seen corresponding path program 1 times [2025-04-25 11:56:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:47,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486617823] [2025-04-25 11:56:47,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:47,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 11:56:47,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 11:56:47,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:47,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:47,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486617823] [2025-04-25 11:56:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486617823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:47,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145468733] [2025-04-25 11:56:47,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:56:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:47,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:47,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 11:56:47,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 11:56:47,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 11:56:47,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:56:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:47,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-25 11:56:47,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:48,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-04-25 11:56:48,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-25 11:56:48,091 INFO L354 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 13 treesize of output 9 [2025-04-25 11:56:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:48,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:56:48,219 INFO L354 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 29 treesize of output 27 [2025-04-25 11:56:48,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:56:48,267 INFO L354 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 13 treesize of output 18 [2025-04-25 11:56:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145468733] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:56:48,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:56:48,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-25 11:56:48,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947438337] [2025-04-25 11:56:48,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:56:48,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-25 11:56:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-25 11:56:48,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-25 11:56:48,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:48,345 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:48,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 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-04-25 11:56:48,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:48,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 11:56:48,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 11:56:48,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:48,922 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:48,922 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:48,922 INFO L139 ounterexampleChecker]: Examining path program with hash -920584380, occurence #1 [2025-04-25 11:56:48,922 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:48,922 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:48,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 918592970, now seen corresponding path program 2 times [2025-04-25 11:56:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:48,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620547190] [2025-04-25 11:56:48,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:56:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:48,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-25 11:56:48,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 11:56:48,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:56:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:48,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:48,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620547190] [2025-04-25 11:56:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620547190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:48,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968714071] [2025-04-25 11:56:48,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:56:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:48,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:48,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 11:56:49,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-25 11:56:49,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 11:56:49,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:56:49,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:49,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 11:56:49,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:56:49,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 11:56:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968714071] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:56:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 11:56:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-25 11:56:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466606514] [2025-04-25 11:56:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:56:49,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 11:56:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:49,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 11:56:49,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-25 11:56:49,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:49,046 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:49,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 11:56:49,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:49,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 11:56:49,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:49,351 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:49,351 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:49,352 INFO L139 ounterexampleChecker]: Examining path program with hash 198969015, occurence #1 [2025-04-25 11:56:49,352 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:49,352 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:49,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1078675662, now seen corresponding path program 3 times [2025-04-25 11:56:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:49,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987184360] [2025-04-25 11:56:49,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:56:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:49,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-25 11:56:49,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 11:56:49,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 11:56:49,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:49,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987184360] [2025-04-25 11:56:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987184360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:49,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707920598] [2025-04-25 11:56:49,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:56:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:49,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:49,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 11:56:49,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-25 11:56:49,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 11:56:49,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 11:56:49,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:49,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 11:56:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:56:49,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:56:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:56:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707920598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:56:49,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:56:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-25 11:56:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910374803] [2025-04-25 11:56:49,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:56:49,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 11:56:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 11:56:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-25 11:56:49,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:49,495 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:49,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:49,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:49,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:49,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:49,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:49,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-25 11:56:49,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:49,772 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:49,772 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:49,772 INFO L139 ounterexampleChecker]: Examining path program with hash -517629758, occurence #1 [2025-04-25 11:56:49,772 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:56:49,772 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:49,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 855836944, now seen corresponding path program 4 times [2025-04-25 11:56:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:49,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384466999] [2025-04-25 11:56:49,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:56:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:49,777 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 11:56:49,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 11:56:49,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 11:56:49,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:49,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:49,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384466999] [2025-04-25 11:56:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384466999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:49,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846635961] [2025-04-25 11:56:49,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:56:49,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:49,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:49,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 11:56:49,829 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 11:56:49,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 11:56:49,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 11:56:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:49,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 11:56:49,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:56:49,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:56:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:56:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846635961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:56:49,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:56:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2025-04-25 11:56:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360874432] [2025-04-25 11:56:49,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:56:49,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 11:56:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 11:56:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-25 11:56:49,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:49,907 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:49,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:49,907 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:50,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:50,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:56:50,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-25 11:56:50,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-25 11:56:50,201 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:50,202 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:50,202 INFO L139 ounterexampleChecker]: Examining path program with hash -379520371, occurence #2 [2025-04-25 11:56:50,202 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:56:50,202 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:56:50,202 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:56:50,203 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-25 11:56:50,203 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:56:50,203 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:56:50,203 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:50,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2031341396, now seen corresponding path program 5 times [2025-04-25 11:56:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:50,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111150954] [2025-04-25 11:56:50,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 11:56:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:50,207 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-25 11:56:50,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-25 11:56:50,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-25 11:56:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:50,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111150954] [2025-04-25 11:56:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111150954] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:50,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907034741] [2025-04-25 11:56:50,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 11:56:50,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:50,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:50,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:50,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-25 11:56:50,608 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-25 11:56:50,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-25 11:56:50,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-25 11:56:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:50,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-25 11:56:50,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:50,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-04-25 11:56:50,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-25 11:56:50,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-04-25 11:56:50,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-25 11:56:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:51,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:56:51,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:56:51,179 INFO L354 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 452 treesize of output 420 [2025-04-25 11:56:51,216 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:56:51,230 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:56:51,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 47 [2025-04-25 11:56:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907034741] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:56:51,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:56:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-04-25 11:56:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462626377] [2025-04-25 11:56:51,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:56:51,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-25 11:56:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:51,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-25 11:56:51,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2025-04-25 11:56:51,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:51,301 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:51,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:56:51,301 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:52,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:52,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:52,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:52,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:52,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:52,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:52,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:52,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:56:52,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-25 11:56:52,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-25 11:56:52,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:52,816 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:56:52,816 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:56:52,816 INFO L139 ounterexampleChecker]: Examining path program with hash -379520371, occurence #3 [2025-04-25 11:56:52,816 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:56:52,816 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:56:52,816 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:56:52,816 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 48 [2025-04-25 11:56:52,816 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:56:52,816 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:56:52,816 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:56:52,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:56:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash 319879380, now seen corresponding path program 6 times [2025-04-25 11:56:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:56:52,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611734725] [2025-04-25 11:56:52,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 11:56:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:56:52,821 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 6 equivalence classes. [2025-04-25 11:56:52,847 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-25 11:56:52,847 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-25 11:56:52,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:56:53,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611734725] [2025-04-25 11:56:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611734725] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:56:53,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113852678] [2025-04-25 11:56:53,780 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 11:56:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:56:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:56:53,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:56:53,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 11:56:53,804 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 6 equivalence classes. [2025-04-25 11:56:53,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-25 11:56:53,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-25 11:56:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:56:53,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-25 11:56:53,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:56:53,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-04-25 11:56:54,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-25 11:56:54,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2025-04-25 11:56:54,384 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2025-04-25 11:56:54,677 INFO L325 Elim1Store]: treesize reduction 49, result has 18.3 percent of original size [2025-04-25 11:56:54,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 79 [2025-04-25 11:56:54,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 60 [2025-04-25 11:56:54,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:56:54,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 103 [2025-04-25 11:56:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:55,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:56:55,665 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:56:55,665 INFO L354 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 7674 treesize of output 7034 [2025-04-25 11:56:55,766 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2025-04-25 11:56:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:56:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113852678] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:56:55,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:56:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 61 [2025-04-25 11:56:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604117691] [2025-04-25 11:56:55,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:56:55,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-25 11:56:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:56:55,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-25 11:56:55,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=3217, Unknown=0, NotChecked=0, Total=3782 [2025-04-25 11:56:55,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:56:55,832 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:56:55,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.1451612903225805) internal successors, (133), 61 states have internal predecessors, (133), 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-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-25 11:56:55,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-25 11:57:00,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-25 11:57:00,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-25 11:57:00,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-25 11:57:00,929 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:57:00,929 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:57:00,929 INFO L139 ounterexampleChecker]: Examining path program with hash 734410775, occurence #1 [2025-04-25 11:57:00,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:57:00,929 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:57:00,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:57:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 354147355, now seen corresponding path program 1 times [2025-04-25 11:57:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:57:00,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704834134] [2025-04-25 11:57:00,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:57:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:57:00,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-25 11:57:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 11:57:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:57:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-25 11:57:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:57:01,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704834134] [2025-04-25 11:57:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704834134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:57:01,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718026215] [2025-04-25 11:57:01,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:57:01,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:57:01,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:57:01,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:57:01,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 11:57:01,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-25 11:57:01,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 11:57:01,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:57:01,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:01,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-25 11:57:01,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:57:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-04-25 11:57:01,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 11:57:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718026215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:57:01,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 11:57:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-04-25 11:57:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486824748] [2025-04-25 11:57:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:57:01,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 11:57:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:57:01,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 11:57:01,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-25 11:57:01,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:57:01,165 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:57:01,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2025-04-25 11:57:01,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:03,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 11:57:03,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-25 11:57:03,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-04-25 11:57:03,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:03,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-25 11:57:03,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:57:03,254 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:57:03,254 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:57:03,255 INFO L139 ounterexampleChecker]: Examining path program with hash 862373665, occurence #1 [2025-04-25 11:57:03,255 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:57:03,255 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:57:03,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:57:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash -35519881, now seen corresponding path program 2 times [2025-04-25 11:57:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:57:03,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301383254] [2025-04-25 11:57:03,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:57:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:57:03,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-25 11:57:03,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 11:57:03,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:57:03,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-25 11:57:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:57:03,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301383254] [2025-04-25 11:57:03,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301383254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:57:03,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892766466] [2025-04-25 11:57:03,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:57:03,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:57:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:57:03,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:57:03,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-25 11:57:03,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-25 11:57:03,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 11:57:03,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:57:03,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:03,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-25 11:57:03,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:57:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-04-25 11:57:03,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:57:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-04-25 11:57:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892766466] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:57:03,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:57:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 10 [2025-04-25 11:57:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178756665] [2025-04-25 11:57:03,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:57:03,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-25 11:57:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:57:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-25 11:57:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-25 11:57:03,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:57:03,579 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:57:03,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:03,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-25 11:57:04,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-25 11:57:04,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 11:57:04,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 11:57:04,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-25 11:57:04,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:57:04,244 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 11:57:04,244 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:57:04,244 INFO L139 ounterexampleChecker]: Examining path program with hash 1956151907, occurence #1 [2025-04-25 11:57:04,244 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:57:04,244 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:57:04,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:57:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 459092389, now seen corresponding path program 3 times [2025-04-25 11:57:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:57:04,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906783148] [2025-04-25 11:57:04,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:57:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:57:04,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-04-25 11:57:04,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 67 of 67 statements. [2025-04-25 11:57:04,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-25 11:57:04,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-25 11:57:05,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:57:05,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906783148] [2025-04-25 11:57:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906783148] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:57:05,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455241172] [2025-04-25 11:57:05,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:57:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:57:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:57:05,410 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:57:05,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-25 11:57:05,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-04-25 11:57:05,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 67 of 67 statements. [2025-04-25 11:57:05,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-25 11:57:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:57:05,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-25 11:57:05,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:57:05,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-04-25 11:57:05,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-25 11:57:05,779 INFO L325 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-04-25 11:57:05,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2025-04-25 11:57:05,999 INFO L325 Elim1Store]: treesize reduction 80, result has 20.0 percent of original size [2025-04-25 11:57:05,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 74 [2025-04-25 11:57:06,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:06,276 INFO L325 Elim1Store]: treesize reduction 128, result has 18.5 percent of original size [2025-04-25 11:57:06,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 79 treesize of output 104 [2025-04-25 11:57:06,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 83 [2025-04-25 11:57:07,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:57:07,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:57:07,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 51 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 193 [2025-04-25 11:57:07,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 183 [2025-04-25 11:57:07,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2025-04-25 11:57:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:57:07,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:57:44,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 101874492801010 treesize of output 95346142511090 [2025-04-25 12:01:35,430 WARN L286 SmtUtils]: Spent 3.84m on a formula simplification. DAG size of input: 413386 DAG size of output: 286 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-25 12:01:36,683 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 12:01:36,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 48 [2025-04-25 12:01:36,734 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 12:01:36,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 12:01:36,736 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 12:01:36,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 12:01:36,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 6 [2025-04-25 12:01:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:01:36,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455241172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:01:36,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:01:36,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 29] total 76 [2025-04-25 12:01:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137232739] [2025-04-25 12:01:36,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:01:36,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-25 12:01:36,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:01:36,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-25 12:01:36,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=5146, Unknown=2, NotChecked=0, Total=5852 [2025-04-25 12:01:36,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:01:36,892 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:01:36,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.2467532467532467) internal successors, (173), 76 states have internal predecessors, (173), 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-04-25 12:01:36,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:01:36,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:01:36,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 12:01:36,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:02:00,930 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:04,555 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:06,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:09,441 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:12,134 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:13,194 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:17,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:20,692 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:23,543 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:27,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:28,146 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:31,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:41,313 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:46,461 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:02:47,574 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-25 12:03:17,325 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:18,392 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:22,939 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:24,583 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:26,754 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:30,323 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:52,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:54,884 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:03:59,784 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:01,050 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:05,133 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:10,398 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:29,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:32,841 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:34,183 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:38,215 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:43,010 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:44,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:51,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:53,709 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:54,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:04:59,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:00,549 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:02,677 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:13,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:15,090 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:23,536 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:41,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:43,457 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:44,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:49,461 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:53,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:05:54,839 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:06:04,503 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:06:07,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:06:11,697 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:06:17,071 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:06:23,750 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:07:09,425 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:07:13,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:07:17,106 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:07:30,201 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:07:50,098 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:02,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:07,253 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:08,860 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:13,308 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:16,778 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:21,309 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:40,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:54,666 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:08:58,101 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:01,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:05,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:08,856 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:12,118 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:15,737 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:19,020 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:22,996 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:25,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:30,378 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:54,724 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 12:09:56,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-25 12:11:19,407 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 12:11:19,409 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-04-25 12:11:19,411 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 12:11:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-25 12:11:19,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-25 12:11:19,691 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 323 known predicates. [2025-04-25 12:11:19,694 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-04-25 12:11:19,694 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-25 12:11:19,694 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-25 12:11:19,694 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-25 12:11:19,699 INFO L422 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1] [2025-04-25 12:11:19,702 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 12:11:19,702 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 12:11:19,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 12:11:19,710 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:11:19 BasicIcfg [2025-04-25 12:11:19,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 12:11:19,711 INFO L158 Benchmark]: Toolchain (without parser) took 873525.72ms. Allocated memory was 142.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 80.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2025-04-25 12:11:19,711 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 142.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:11:19,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.69ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:11:19,712 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:11:19,712 INFO L158 Benchmark]: RCFGBuilder took 189.66ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 67.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 12:11:19,713 INFO L158 Benchmark]: TraceAbstraction took 873281.50ms. Allocated memory was 142.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 66.6MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2025-04-25 12:11:19,713 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.19ms. Allocated memory is still 142.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.69ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 189.66ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 67.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 873281.50ms. Allocated memory was 142.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 66.6MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 5.2GB. 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: 7696, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 1204, dependent conditional: 1200, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6503, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6503, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 736, dependent conditional: 732, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 252, independent unconditional: 6240, dependent: 736, dependent conditional: 453, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 252, independent unconditional: 6240, dependent: 736, dependent conditional: 453, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 474, independent: 414, independent conditional: 9, independent unconditional: 405, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 474, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 71, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 99, dependent conditional: 87, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7228, independent: 6078, independent conditional: 243, independent unconditional: 5835, dependent: 676, dependent conditional: 399, dependent unconditional: 277, unknown: 474, unknown conditional: 63, unknown unconditional: 411] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 414, Positive conditional cache size: 9, Positive unconditional cache size: 405, Negative cache size: 60, Negative conditional cache size: 54, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6065, Maximal queried relation: 9, Independence queries for same thread: 1193, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 86, Number of trivial persistent sets: 48, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 458, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7696, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 1204, dependent conditional: 1200, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6503, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6503, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 6038, independent unconditional: 454, dependent: 736, dependent conditional: 732, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 252, independent unconditional: 6240, dependent: 736, dependent conditional: 453, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7228, independent: 6492, independent conditional: 252, independent unconditional: 6240, dependent: 736, dependent conditional: 453, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 474, independent: 414, independent conditional: 9, independent unconditional: 405, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 474, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 71, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 60, dependent conditional: 54, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 99, dependent conditional: 87, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7228, independent: 6078, independent conditional: 243, independent unconditional: 5835, dependent: 676, dependent conditional: 399, dependent unconditional: 277, unknown: 474, unknown conditional: 63, unknown unconditional: 411] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 414, Positive conditional cache size: 9, Positive unconditional cache size: 405, Negative cache size: 60, Negative conditional cache size: 54, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6065, Maximal queried relation: 9, Independence queries for same thread: 1193 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 323 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 323 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 323 known predicates. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 323 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 42 locations, 49 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 873.1s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 592.2s, 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: 488, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 278.4s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1090 ConstructedInterpolants, 12 QuantifiedInterpolants, 19583 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 486/1182 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]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 2, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown