/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-07 07:50:02,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-07 07:50:03,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-07 07:50:03,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-07 07:50:03,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-07 07:50:03,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-07 07:50:03,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-07 07:50:03,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-07 07:50:03,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-07 07:50:03,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-07 07:50:03,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-07 07:50:03,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-07 07:50:03,046 INFO L153 SettingsManager]: * Use SBE=true [2024-04-07 07:50:03,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-07 07:50:03,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-07 07:50:03,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-07 07:50:03,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-07 07:50:03,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-07 07:50:03,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-07 07:50:03,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-07 07:50:03,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-07 07:50:03,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-07 07:50:03,050 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-07 07:50:03,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-07 07:50:03,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 07:50:03,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-07 07:50:03,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-07 07:50:03,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-07 07:50:03,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-07 07:50:03,060 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-07 07:50:03,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-07 07:50:03,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-07 07:50:03,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-07 07:50:03,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-07 07:50:03,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-07 07:50:03,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-07 07:50:03,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-07 07:50:03,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-07 07:50:03,299 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-07 07:50:03,301 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-07 07:50:03,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl [2024-04-07 07:50:03,302 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2024-04-07 07:50:03,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-07 07:50:03,371 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-07 07:50:03,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-07 07:50:03,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-07 07:50:03,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-07 07:50:03,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,422 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-07 07:50:03,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-07 07:50:03,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-07 07:50:03,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-07 07:50:03,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-07 07:50:03,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-07 07:50:03,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-07 07:50:03,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-07 07:50:03,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-07 07:50:03,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/1) ... [2024-04-07 07:50:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 07:50:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:03,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-07 07:50:03,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-07 07:50:03,514 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-07 07:50:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-07 07:50:03,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-07 07:50:03,514 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-07 07:50:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-07 07:50:03,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-07 07:50:03,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-07 07:50:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-07 07:50:03,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-07 07:50:03,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-07 07:50:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-07 07:50:03,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-07 07:50:03,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-07 07:50:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-07 07:50:03,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-07 07:50:03,516 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-07 07:50:03,557 INFO L241 CfgBuilder]: Building ICFG [2024-04-07 07:50:03,558 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-07 07:50:03,663 INFO L282 CfgBuilder]: Performing block encoding [2024-04-07 07:50:03,686 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-07 07:50:03,686 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-07 07:50:03,687 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:50:03 BoogieIcfgContainer [2024-04-07 07:50:03,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-07 07:50:03,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-07 07:50:03,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-07 07:50:03,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-07 07:50:03,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 07:50:03" (1/2) ... [2024-04-07 07:50:03,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac504f9 and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:50:03, skipping insertion in model container [2024-04-07 07:50:03,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:50:03" (2/2) ... [2024-04-07 07:50:03,700 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2024-04-07 07:50:03,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-07 07:50:03,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-07 07:50:03,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-07 07:50:03,715 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-07 07:50:03,763 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-07 07:50:03,794 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-07 07:50:03,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-07 07:50:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:03,797 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) [2024-04-07 07:50:03,809 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 [2024-04-07 07:50:03,833 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-07 07:50:03,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:03,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-07 07:50:03,850 INFO L357 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, mHoare=true, 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;@3ae01d7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-07 07:50:03,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-07 07:50:03,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:03,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2024-04-07 07:50:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470743032] [2024-04-07 07:50:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470743032] [2024-04-07 07:50:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470743032] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:04,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:04,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-07 07:50:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443527735] [2024-04-07 07:50:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 07:50:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 07:50:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-07 07:50:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:04,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:04,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:04,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-07 07:50:04,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:04,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2024-04-07 07:50:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224033710] [2024-04-07 07:50:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-07 07:50:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224033710] [2024-04-07 07:50:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224033710] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 07:50:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019270110] [2024-04-07 07:50:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:04,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 07:50:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 07:50:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-07 07:50:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:04,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:04,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:04,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-07 07:50:04,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:04,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2024-04-07 07:50:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:04,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77198826] [2024-04-07 07:50:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:05,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77198826] [2024-04-07 07:50:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77198826] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:05,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:05,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 07:50:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614650659] [2024-04-07 07:50:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 07:50:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-07 07:50:05,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1173544902, now seen corresponding path program 1 times [2024-04-07 07:50:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:05,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:05,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 07:50:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 07:50:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-07 07:50:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:05,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:05,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:05,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:05,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-04-07 07:50:05,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:05,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2024-04-07 07:50:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043093388] [2024-04-07 07:50:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043093388] [2024-04-07 07:50:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043093388] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 07:50:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915566597] [2024-04-07 07:50:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:05,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 07:50:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 07:50:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 07:50:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:05,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:05,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:05,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:05,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:05,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-07 07:50:05,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:05,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2024-04-07 07:50:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395867056] [2024-04-07 07:50:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395867056] [2024-04-07 07:50:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395867056] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 07:50:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142309543] [2024-04-07 07:50:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:06,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:06,098 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) [2024-04-07 07:50:06,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-07 07:50:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:06,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-07 07:50:06,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 07:50:06,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-07 07:50:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:06,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 07:50:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142309543] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 07:50:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 07:50:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-07 07:50:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615494260] [2024-04-07 07:50:06,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 07:50:06,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-07 07:50:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-07 07:50:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-07 07:50:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:06,592 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:06,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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) [2024-04-07 07:50:06,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:06,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:06,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:06,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:06,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-07 07:50:07,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-07 07:50:07,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-04-07 07:50:07,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:07,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2024-04-07 07:50:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229970337] [2024-04-07 07:50:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:07,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229970337] [2024-04-07 07:50:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229970337] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 07:50:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569939140] [2024-04-07 07:50:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:07,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 07:50:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 07:50:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-07 07:50:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:07,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:07,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-07 07:50:07,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:07,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-07 07:50:07,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:07,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2024-04-07 07:50:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337122204] [2024-04-07 07:50:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337122204] [2024-04-07 07:50:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337122204] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:50:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:50:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 07:50:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978616907] [2024-04-07 07:50:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:50:08,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 07:50:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:08,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-07 07:50:08,122 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-07 07:50:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 692199915, now seen corresponding path program 1 times [2024-04-07 07:50:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:08,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 07:50:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:08,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-07 07:50:08,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-07 07:50:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -16639034, now seen corresponding path program 1 times [2024-04-07 07:50:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:50:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 07:50:08,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-04-07 07:50:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:08,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:08,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-04-07 07:50:08,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:08,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times [2024-04-07 07:50:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578017365] [2024-04-07 07:50:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578017365] [2024-04-07 07:50:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578017365] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 07:50:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427154700] [2024-04-07 07:50:08,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-07 07:50:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:08,810 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) [2024-04-07 07:50:08,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-07 07:50:08,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-07 07:50:08,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-07 07:50:08,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2024-04-07 07:50:08,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 07:50:08,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-07 07:50:08,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-04-07 07:50:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:08,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 07:50:09,139 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-04-07 07:50:09,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2024-04-07 07:50:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427154700] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 07:50:09,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 07:50:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-04-07 07:50:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823848422] [2024-04-07 07:50:09,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 07:50:09,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-04-07 07:50:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:09,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-04-07 07:50:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-04-07 07:50:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:09,221 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:09,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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) [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:09,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:50:10,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-07 07:50:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:10,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:10,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -604551849, now seen corresponding path program 3 times [2024-04-07 07:50:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438391817] [2024-04-07 07:50:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438391817] [2024-04-07 07:50:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438391817] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 07:50:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694006903] [2024-04-07 07:50:10,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-07 07:50:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:10,777 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) [2024-04-07 07:50:10,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-07 07:50:10,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-04-07 07:50:10,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-07 07:50:10,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2024-04-07 07:50:10,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 07:50:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-07 07:50:10,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 07:50:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-07 07:50:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694006903] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 07:50:10,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 07:50:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-04-07 07:50:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539915688] [2024-04-07 07:50:10,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 07:50:10,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-07 07:50:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:11,020 INFO L85 PathProgramCache]: Analyzing trace with hash 692199915, now seen corresponding path program 2 times [2024-04-07 07:50:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:11,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 07:50:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 07:50:11,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-07 07:50:11,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-04-07 07:50:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:11,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:50:11,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:11,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:11,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:11,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:11,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:50:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:50:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:12,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-07 07:50:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:12,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1969997795, now seen corresponding path program 4 times [2024-04-07 07:50:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800195249] [2024-04-07 07:50:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800195249] [2024-04-07 07:50:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800195249] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 07:50:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759780523] [2024-04-07 07:50:12,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-07 07:50:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:12,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:12,872 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) [2024-04-07 07:50:12,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-07 07:50:12,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-07 07:50:12,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-07 07:50:12,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2024-04-07 07:50:12,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 07:50:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:12,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 07:50:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 07:50:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759780523] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 07:50:12,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 07:50:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-04-07 07:50:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832411973] [2024-04-07 07:50:12,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 07:50:12,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-07 07:50:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:50:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-07 07:50:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-04-07 07:50:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:12,999 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:50:12,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 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) [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:50:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:13,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:50:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:50:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-07 07:50:17,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-07 07:50:17,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-04-07 07:50:17,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:50:17,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:50:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash -847992609, now seen corresponding path program 5 times [2024-04-07 07:50:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:50:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553715515] [2024-04-07 07:50:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:50:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:50:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:50:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-07 07:50:17,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:50:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553715515] [2024-04-07 07:50:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553715515] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 07:50:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717262312] [2024-04-07 07:50:17,786 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-07 07:50:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 07:50:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 07:50:17,787 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) [2024-04-07 07:50:17,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-07 07:50:17,827 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-04-07 07:50:17,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-07 07:50:17,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjunts are in the unsatisfiable core [2024-04-07 07:50:17,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 07:50:17,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-07 07:50:17,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-07 07:50:17,974 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-04-07 07:50:17,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 53 [2024-04-07 07:50:18,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-07 07:50:18,171 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-04-07 07:50:18,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 53 [2024-04-07 07:50:18,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-04-07 07:50:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-07 07:50:18,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 07:50:24,588 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse0 (select c_A i))) (or (< c_min .cse0) (< .cse0 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse1 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (< c_min .cse1) (< (select c_A i) .cse1))))) is different from false [2024-04-07 07:51:36,909 INFO L349 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2024-04-07 07:51:36,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2396 treesize of output 2321 [2024-04-07 07:51:38,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,637 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 678 treesize of output 1 [2024-04-07 07:51:38,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,648 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 340 treesize of output 1 [2024-04-07 07:51:38,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,659 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 340 treesize of output 1 [2024-04-07 07:51:38,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,669 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 214 treesize of output 1 [2024-04-07 07:51:38,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,678 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 216 treesize of output 1 [2024-04-07 07:51:38,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:38,688 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:38,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 260 treesize of output 1 [2024-04-07 07:51:38,918 INFO L349 Elim1Store]: treesize reduction 1680, result has 0.1 percent of original size [2024-04-07 07:51:38,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 43247 treesize of output 1 [2024-04-07 07:51:39,269 INFO L349 Elim1Store]: treesize reduction 1680, result has 0.1 percent of original size [2024-04-07 07:51:39,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 53984 treesize of output 1 [2024-04-07 07:51:39,273 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:39,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:39,279 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:39,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 340 treesize of output 1 [2024-04-07 07:51:39,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:39,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-07 07:51:39,287 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-07 07:51:39,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 214 treesize of output 1 [2024-04-07 07:51:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 4 times theorem prover too weak. 9 trivial. 5 not checked. [2024-04-07 07:51:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717262312] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 07:51:46,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 07:51:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-04-07 07:51:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64440970] [2024-04-07 07:51:46,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 07:51:46,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-04-07 07:51:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:51:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-04-07 07:51:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=438, Unknown=33, NotChecked=46, Total=650 [2024-04-07 07:51:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:51:46,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:51:46,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 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) [2024-04-07 07:51:46,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:51:46,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:51:46,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-07 07:51:46,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:51:49,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:51:51,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:51:53,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:51:56,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:51:58,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:52:02,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:52:04,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-07 07:52:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-07 07:52:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-07 07:52:14,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-07 07:52:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-04-07 07:52:14,746 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-07 07:52:14,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 07:52:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 468809223, now seen corresponding path program 3 times [2024-04-07 07:52:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 07:52:14,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857357025] [2024-04-07 07:52:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 07:52:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 07:52:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 07:52:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 07:52:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 07:52:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857357025] [2024-04-07 07:52:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857357025] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 07:52:14,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 07:52:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 07:52:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450317994] [2024-04-07 07:52:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 07:52:14,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 07:52:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 07:52:14,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 07:52:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-07 07:52:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:52:14,995 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 07:52:14,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 07:52:14,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-07 07:52:14,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 07:52:39,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:41,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:43,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:45,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:47,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:50,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:52,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:54,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:56,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:52:58,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:00,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:02,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:04,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:06,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:08,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:10,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:12,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:14,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:16,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:18,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:22,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:24,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:26,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:30,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:32,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:34,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:36,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:38,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:41,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:43,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:45,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:47,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:49,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:51,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:53,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:55,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:57,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:53:59,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:01,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:03,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:05,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:07,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:09,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:11,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:13,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:15,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:17,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:19,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:21,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:24,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:26,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:28,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:30,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:32,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:34,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:36,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:38,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:41,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:43,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:45,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:47,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:49,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:51,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:53,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:55,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 07:54:57,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:54:59,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:01,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:03,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:05,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:07,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:09,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:11,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:13,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:15,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:17,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:19,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:21,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:23,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:25,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:27,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:29,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:31,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:33,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:35,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:37,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:39,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:41,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:43,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:45,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:47,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:49,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:51,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:53,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:55,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:57,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:55:59,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:01,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:03,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:05,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:07,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:09,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:11,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:14,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:16,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:18,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:22,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:26,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:28,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:30,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:32,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:34,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_26))) (let ((.cse0 (+ 2 (select (store .cse1 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse0) (< (select .cse1 i) .cse0))))) (< v_l_29 .cse2))) (or (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1))) (< (+ 2 c_l) c_N)) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse3 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ 2 (select (store .cse3 v_l_29 v_ArrVal_27) 0)))) (forall ((i Int)) (<= (select .cse3 i) c_min))))) (< v_l_29 .cse2))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse5 (store c_A c_l v_ArrVal_26))) (let ((.cse4 (select .cse5 i))) (or (< c_min .cse4) (< .cse4 (+ 2 (select (store .cse5 v_l_29 v_ArrVal_27) 0))))))) (< v_l_29 .cse2))))) is different from false [2024-04-07 07:56:36,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:38,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:40,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:42,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:44,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:48,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:50,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 07:56:52,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:54,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:56,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:56:58,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:00,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:02,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:06,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:08,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:10,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:12,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:57:14,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:29,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:31,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:33,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:35,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:37,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:39,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:41,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:43,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:45,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:47,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:49,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:51,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:54,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:56,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:58:58,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:00,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:02,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:04,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:06,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:08,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:10,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:12,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:14,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:16,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:18,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:20,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:22,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:25,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:27,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:29,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:31,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:33,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:35,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:37,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:39,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:43,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:45,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 07:59:47,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:49,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_min 1)) (.cse0 (select c_A c_i)) (.cse4 (select c_A c_l)) (.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_i_58 Int) (v_l_30 Int)) (let ((.cse5 (store c_A c_l v_ArrVal_25))) (let ((.cse3 (store .cse5 v_l_30 v_ArrVal_26))) (let ((.cse1 (+ (select (store .cse3 v_l_29 v_ArrVal_27) 0) 2))) (or (< .cse0 .cse1) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse3 v_i_43) .cse1) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse5 v_i_58) .cse1) (< c_min .cse1)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse8 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int)) (let ((.cse7 (store .cse8 v_l_30 v_ArrVal_26))) (let ((.cse6 (select .cse7 v_subst_3))) (or (< .cse6 (+ (select (store .cse7 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse6) (< v_l_29 (+ v_l_30 1)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse8 i) .cse9)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_55 Int) (v_ArrVal_27 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse13 (store c_A c_l v_ArrVal_25))) (let ((.cse11 (store .cse13 v_l_30 v_ArrVal_26))) (let ((.cse14 (select (store .cse11 v_l_29 v_ArrVal_27) 0))) (let ((.cse10 (+ .cse14 2)) (.cse12 (+ .cse14 3))) (or (< .cse0 .cse10) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse11 v_subst_1) .cse12) (< c_min .cse10) (< (select .cse13 v_i_55) .cse12))))))) (forall ((v_i_61 Int) (v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse18 (store c_A c_l v_ArrVal_25))) (let ((.cse17 (store .cse18 v_l_30 v_ArrVal_26))) (let ((.cse16 (+ (select (store .cse17 v_l_29 v_ArrVal_27) 0) 2)) (.cse15 (select .cse18 v_i_61))) (or (< .cse15 .cse16) (< v_l_29 (+ v_l_30 1)) (< c_min .cse15) (< (select .cse17 v_i_42) .cse16) (< v_l_30 .cse2) (< .cse0 .cse15) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse21 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int)) (let ((.cse20 (store .cse21 v_l_30 v_ArrVal_26))) (let ((.cse19 (+ (select (store .cse20 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< c_min .cse19) (< (select .cse20 v_subst_2) .cse19))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse21 i) .cse9)))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse23 (store c_A c_l v_ArrVal_26))) (let ((.cse22 (+ 2 (select (store .cse23 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse22) (< (select .cse23 i) .cse22))))) (< v_l_29 .cse2))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse27 (store c_A c_l v_ArrVal_25))) (let ((.cse26 (select .cse27 i))) (or (forall ((v_l_29 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse25 (store .cse27 v_l_30 v_ArrVal_26))) (let ((.cse24 (select .cse25 v_i_41))) (or (< .cse24 (+ (select (store .cse25 v_l_29 v_ArrVal_27) 0) 2)) (< .cse26 .cse24) (< v_l_29 (+ v_l_30 1)))))) (< c_min .cse26))))))))) (or (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1))) (< (+ 2 c_l) c_N)) (or (and (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_5 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse31 (store c_A c_l v_ArrVal_25))) (let ((.cse28 (store .cse31 v_l_30 v_ArrVal_26))) (let ((.cse30 (select (store .cse28 v_l_29 v_ArrVal_27) 0))) (let ((.cse29 (+ .cse30 3))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse28 v_subst_1) .cse29) (< c_min (+ .cse30 2)) (< (select .cse31 v_subst_5) .cse29))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_6 Int) (v_i_45 Int) (v_l_30 Int)) (let ((.cse32 (store c_A c_l v_ArrVal_25))) (let ((.cse34 (store .cse32 v_l_30 v_ArrVal_26))) (let ((.cse35 (select (store .cse34 v_l_29 v_ArrVal_27) 0))) (let ((.cse33 (+ .cse35 2))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse32 v_subst_6) .cse33) (< (select .cse34 v_i_45) (+ .cse35 3)) (< c_min .cse33))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_subst_11 Int) (v_l_30 Int)) (let ((.cse37 (store c_A c_l v_ArrVal_25))) (let ((.cse38 (store .cse37 v_l_30 v_ArrVal_26))) (let ((.cse36 (select .cse38 v_i_44))) (or (< c_min .cse36) (< v_l_29 (+ v_l_30 1)) (< (select .cse37 v_subst_11) .cse36) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse36 (+ (select (store .cse38 v_l_29 v_ArrVal_27) 0) 2))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_subst_4 Int) (v_l_30 Int)) (let ((.cse41 (store c_A c_l v_ArrVal_25))) (let ((.cse39 (store .cse41 v_l_30 v_ArrVal_26))) (let ((.cse40 (+ (select (store .cse39 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse39 v_i_43) .cse40) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse40) (< (select .cse41 v_subst_4) .cse40)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_subst_10 Int) (v_l_30 Int)) (let ((.cse44 (store c_A c_l v_ArrVal_25))) (let ((.cse43 (store .cse44 v_l_30 v_ArrVal_26))) (let ((.cse42 (select .cse43 v_subst_3))) (or (< .cse42 (+ (select (store .cse43 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse42) (< (select .cse44 v_subst_10) (+ .cse42 1)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_7 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse45 (store c_A c_l v_ArrVal_25))) (let ((.cse48 (store .cse45 v_l_30 v_ArrVal_26))) (let ((.cse46 (select (store .cse48 v_l_29 v_ArrVal_27) 0))) (let ((.cse47 (+ .cse46 2))) (or (< (select .cse45 v_subst_7) (+ .cse46 3)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse47) (< (select .cse48 v_subst_2) .cse47))))))) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_subst_8 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse52 (store c_A c_l v_ArrVal_25))) (let ((.cse51 (store .cse52 v_l_30 v_ArrVal_26))) (let ((.cse50 (select (store .cse51 v_l_29 v_ArrVal_27) 0)) (.cse49 (select .cse52 v_subst_8))) (or (< v_l_29 (+ v_l_30 1)) (< .cse49 (+ .cse50 2)) (< v_l_30 .cse2) (< (select .cse51 v_i_40) (+ .cse50 3)) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse49)))))) (forall ((v_subst_12 Int) (v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse56 (store c_A c_l v_ArrVal_25))) (let ((.cse53 (store .cse56 v_l_30 v_ArrVal_26))) (let ((.cse55 (select .cse56 v_subst_12)) (.cse54 (+ (select (store .cse53 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse53 v_i_42) .cse54) (< v_l_30 .cse2) (< c_min .cse55) (< .cse55 .cse54) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_subst_9 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse60 (store c_A c_l v_ArrVal_25))) (let ((.cse58 (store .cse60 v_l_30 v_ArrVal_26))) (let ((.cse59 (select .cse60 v_subst_9)) (.cse57 (select .cse58 v_i_41))) (or (< .cse57 (+ (select (store .cse58 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< c_min .cse59) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse59 .cse57))))))) (< .cse0 .cse9)) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (i Int)) (let ((.cse61 (store c_A c_l v_ArrVal_25))) (let ((.cse63 (store .cse61 v_l_30 v_ArrVal_26))) (let ((.cse62 (+ (select (store .cse63 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse61 i) .cse62) (< (select .cse63 v_i_43) .cse62) (< c_min .cse62)))))))) (< v_l_30 .cse2))) (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (forall ((v_i_62 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_l_30 Int)) (let ((.cse66 (store c_A c_l v_ArrVal_25))) (let ((.cse65 (store .cse66 v_l_30 v_ArrVal_26))) (let ((.cse64 (select .cse65 v_subst_3))) (or (< .cse64 (+ (select (store .cse65 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse64) (< v_l_29 (+ v_l_30 1)) (< (select .cse66 v_i_62) (+ .cse64 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse64)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_i_57 Int) (v_l_30 Int)) (let ((.cse68 (store c_A c_l v_ArrVal_25))) (let ((.cse69 (store .cse68 v_l_30 v_ArrVal_26))) (let ((.cse67 (select .cse69 v_i_44))) (or (< c_min .cse67) (< v_l_29 (+ v_l_30 1)) (< (select .cse68 v_i_57) .cse67) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse67 (+ (select (store .cse69 v_l_29 v_ArrVal_27) 0) 2)) (< .cse0 .cse67)))))) (or (< c_min .cse0) (and (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_69 Int) (v_l_30 Int)) (let ((.cse73 (store c_A c_l v_ArrVal_25))) (let ((.cse70 (store .cse73 v_l_30 v_ArrVal_26))) (let ((.cse72 (select .cse73 v_i_69)) (.cse71 (+ (select (store .cse70 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse70 v_i_42) .cse71) (< v_l_30 .cse2) (< .cse0 .cse72) (< (+ v_ArrVal_25 1) .cse4) (< .cse72 .cse71)))))) (forall ((v_l_29 Int) (v_i_64 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse75 (store c_A c_l v_ArrVal_25))) (let ((.cse77 (store .cse75 v_l_30 v_ArrVal_26))) (let ((.cse76 (select (store .cse77 v_l_29 v_ArrVal_27) 0))) (let ((.cse74 (+ .cse76 2))) (or (< .cse0 .cse74) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse75 v_i_64) (+ .cse76 3)) (< (select .cse77 v_subst_2) .cse74))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_66 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_l_30 Int)) (let ((.cse80 (store c_A c_l v_ArrVal_25))) (let ((.cse79 (store .cse80 v_l_30 v_ArrVal_26))) (let ((.cse78 (select .cse79 v_subst_3))) (or (< .cse78 (+ (select (store .cse79 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse80 v_i_66) (+ .cse78 1)) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse78)))))) (forall ((v_i_71 Int) (v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse84 (store c_A c_l v_ArrVal_25))) (let ((.cse83 (store .cse84 v_l_30 v_ArrVal_26))) (let ((.cse81 (select .cse84 v_i_71)) (.cse82 (select (store .cse83 v_l_29 v_ArrVal_27) 0))) (or (< .cse0 .cse81) (< v_l_29 (+ v_l_30 1)) (< .cse81 (+ .cse82 2)) (< v_l_30 .cse2) (< (select .cse83 v_i_40) (+ .cse82 3)) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_i_72 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse85 (store c_A c_l v_ArrVal_25))) (let ((.cse87 (store .cse85 v_l_30 v_ArrVal_26))) (let ((.cse86 (select .cse87 v_i_44))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse85 v_i_72) .cse86) (< .cse86 (+ (select (store .cse87 v_l_29 v_ArrVal_27) 0) 2)) (< .cse0 .cse86)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_68 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse91 (store c_A c_l v_ArrVal_25))) (let ((.cse89 (store .cse91 v_l_30 v_ArrVal_26))) (let ((.cse88 (select (store .cse89 v_l_29 v_ArrVal_27) 0))) (let ((.cse90 (+ .cse88 3))) (or (< .cse0 (+ .cse88 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse89 v_subst_1) .cse90) (< (select .cse91 v_i_68) .cse90))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_65 Int) (v_i_45 Int) (v_l_30 Int)) (let ((.cse93 (store c_A c_l v_ArrVal_25))) (let ((.cse94 (store .cse93 v_l_30 v_ArrVal_26))) (let ((.cse95 (select (store .cse94 v_l_29 v_ArrVal_27) 0))) (let ((.cse92 (+ .cse95 2))) (or (< .cse0 .cse92) (< (select .cse93 v_i_65) .cse92) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse94 v_i_45) (+ .cse95 3)))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_67 Int) (v_l_30 Int)) (let ((.cse99 (store c_A c_l v_ArrVal_25))) (let ((.cse97 (store .cse99 v_l_30 v_ArrVal_26))) (let ((.cse98 (select .cse99 v_i_67)) (.cse96 (select .cse97 v_i_41))) (or (< .cse96 (+ (select (store .cse97 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse98) (< .cse98 .cse96)))))) (forall ((v_i_70 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_l_30 Int)) (let ((.cse101 (store c_A c_l v_ArrVal_25))) (let ((.cse102 (store .cse101 v_l_30 v_ArrVal_26))) (let ((.cse100 (+ (select (store .cse102 v_l_29 v_ArrVal_27) 0) 2))) (or (< .cse0 .cse100) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse101 v_i_70) .cse100) (< (select .cse102 v_i_43) .cse100) (< (+ v_ArrVal_25 1) .cse4)))))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse103 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ 2 (select (store .cse103 v_l_29 v_ArrVal_27) 0)))) (forall ((i Int)) (<= (select .cse103 i) c_min))))) (< v_l_29 .cse2))) (forall ((v_i_60 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse105 (store c_A c_l v_ArrVal_25))) (let ((.cse107 (store .cse105 v_l_30 v_ArrVal_26))) (let ((.cse106 (select (store .cse107 v_l_29 v_ArrVal_27) 0))) (let ((.cse104 (+ .cse106 2))) (or (< .cse0 .cse104) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse105 v_i_60) (+ .cse106 3)) (< c_min .cse104) (< (select .cse107 v_subst_2) .cse104))))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse111 (store c_A c_l v_ArrVal_25))) (let ((.cse108 (select .cse111 i))) (or (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse110 (store .cse111 v_l_30 v_ArrVal_26))) (let ((.cse109 (select (store .cse110 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< .cse108 (+ .cse109 2)) (< (select .cse110 v_i_40) (+ .cse109 3)))))) (< c_min .cse108))))))))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_45 Int)) (let ((.cse112 (store c_A c_l v_ArrVal_25))) (let ((.cse114 (store .cse112 v_l_30 v_ArrVal_26))) (let ((.cse115 (select (store .cse114 v_l_29 v_ArrVal_27) 0))) (let ((.cse113 (+ .cse115 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse112 i) .cse113) (< (select .cse114 v_i_45) (+ .cse115 3)) (< c_min .cse113))))))) (< (+ v_ArrVal_25 1) .cse4))) (< v_l_30 .cse2))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_45 Int) (v_i_56 Int) (v_l_30 Int)) (let ((.cse117 (store c_A c_l v_ArrVal_25))) (let ((.cse118 (store .cse117 v_l_30 v_ArrVal_26))) (let ((.cse119 (select (store .cse118 v_l_29 v_ArrVal_27) 0))) (let ((.cse116 (+ .cse119 2))) (or (< .cse0 .cse116) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse117 v_i_56) .cse116) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse118 v_i_45) (+ .cse119 3)) (< c_min .cse116))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_59 Int) (v_l_30 Int)) (let ((.cse123 (store c_A c_l v_ArrVal_25))) (let ((.cse121 (store .cse123 v_l_30 v_ArrVal_26))) (let ((.cse120 (select .cse121 v_i_41)) (.cse122 (select .cse123 v_i_59))) (or (< .cse120 (+ (select (store .cse121 v_l_29 v_ArrVal_27) 0) 2)) (< .cse122 .cse120) (< v_l_29 (+ v_l_30 1)) (< .cse0 .cse122) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse122)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse126 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_1 Int)) (let ((.cse124 (store .cse126 v_l_30 v_ArrVal_26))) (let ((.cse125 (select (store .cse124 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse124 v_subst_1) (+ .cse125 3)) (< c_min (+ .cse125 2)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse126 i) .cse9)))))) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_i_63 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse130 (store c_A c_l v_ArrVal_25))) (let ((.cse129 (store .cse130 v_l_30 v_ArrVal_26))) (let ((.cse128 (select (store .cse129 v_l_29 v_ArrVal_27) 0)) (.cse127 (select .cse130 v_i_63))) (or (< .cse127 (+ .cse128 2)) (< v_l_29 (+ v_l_30 1)) (< c_min .cse127) (< v_l_30 .cse2) (< (select .cse129 v_i_40) (+ .cse128 3)) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse127)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse134 (store c_A c_l v_ArrVal_25))) (let ((.cse131 (select .cse134 i))) (or (< c_min .cse131) (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse132 (store .cse134 v_l_30 v_ArrVal_26))) (let ((.cse133 (+ (select (store .cse132 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse132 v_i_42) .cse133) (< .cse131 .cse133))))))))))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse136 (store c_A c_l v_ArrVal_26))) (let ((.cse135 (select .cse136 i))) (or (< c_min .cse135) (< .cse135 (+ 2 (select (store .cse136 v_l_29 v_ArrVal_27) 0))))))) (< v_l_29 .cse2))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse138 (store c_A c_l v_ArrVal_25))) (let ((.cse139 (store .cse138 v_l_30 v_ArrVal_26))) (let ((.cse137 (select .cse139 v_i_44))) (or (< c_min .cse137) (< v_l_29 (+ v_l_30 1)) (< (select .cse138 i) .cse137) (< .cse137 (+ (select (store .cse139 v_l_29 v_ArrVal_27) 0) 2))))))))) (< v_l_30 .cse2))))) is different from false [2024-04-07 07:59:51,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:53,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:55,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 07:59:57,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:29,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:31,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:33,931 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1)))) (.cse5 (+ c_min 1)) (.cse4 (select c_A c_l)) (.cse0 (+ c_l 1))) (and (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse3 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int)) (let ((.cse2 (store .cse3 v_l_30 v_ArrVal_26))) (let ((.cse1 (select .cse2 v_subst_3))) (or (< .cse1 (+ (select (store .cse2 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse1) (< v_l_29 (+ v_l_30 1)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse3 i) .cse5)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse8 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int)) (let ((.cse7 (store .cse8 v_l_30 v_ArrVal_26))) (let ((.cse6 (+ (select (store .cse7 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< c_min .cse6) (< (select .cse7 v_subst_2) .cse6))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse8 i) .cse5)))))) (or (< .cse0 c_i) .cse9) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse11 (store c_A c_l v_ArrVal_26))) (let ((.cse10 (+ 2 (select (store .cse11 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse10) (< (select .cse11 i) .cse10))))) (< v_l_29 .cse0))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse15 (store c_A c_l v_ArrVal_25))) (let ((.cse14 (select .cse15 i))) (or (forall ((v_l_29 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse13 (store .cse15 v_l_30 v_ArrVal_26))) (let ((.cse12 (select .cse13 v_i_41))) (or (< .cse12 (+ (select (store .cse13 v_l_29 v_ArrVal_27) 0) 2)) (< .cse14 .cse12) (< v_l_29 (+ v_l_30 1)))))) (< c_min .cse14))))))))) (or .cse9 (< (+ 2 c_l) c_N)) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (i Int)) (let ((.cse16 (store c_A c_l v_ArrVal_25))) (let ((.cse18 (store .cse16 v_l_30 v_ArrVal_26))) (let ((.cse17 (+ (select (store .cse18 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse16 i) .cse17) (< (select .cse18 v_i_43) .cse17) (< c_min .cse17)))))))) (< v_l_30 .cse0))) (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse19 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ 2 (select (store .cse19 v_l_29 v_ArrVal_27) 0)))) (forall ((i Int)) (<= (select .cse19 i) c_min))))) (< v_l_29 .cse0))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse23 (store c_A c_l v_ArrVal_25))) (let ((.cse20 (select .cse23 i))) (or (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse22 (store .cse23 v_l_30 v_ArrVal_26))) (let ((.cse21 (select (store .cse22 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< .cse20 (+ .cse21 2)) (< (select .cse22 v_i_40) (+ .cse21 3)))))) (< c_min .cse20))))))))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_45 Int)) (let ((.cse24 (store c_A c_l v_ArrVal_25))) (let ((.cse26 (store .cse24 v_l_30 v_ArrVal_26))) (let ((.cse27 (select (store .cse26 v_l_29 v_ArrVal_27) 0))) (let ((.cse25 (+ .cse27 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse24 i) .cse25) (< (select .cse26 v_i_45) (+ .cse27 3)) (< c_min .cse25))))))) (< (+ v_ArrVal_25 1) .cse4))) (< v_l_30 .cse0))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse30 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_1 Int)) (let ((.cse28 (store .cse30 v_l_30 v_ArrVal_26))) (let ((.cse29 (select (store .cse28 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse28 v_subst_1) (+ .cse29 3)) (< c_min (+ .cse29 2)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse30 i) .cse5)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse34 (store c_A c_l v_ArrVal_25))) (let ((.cse31 (select .cse34 i))) (or (< c_min .cse31) (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse32 (store .cse34 v_l_30 v_ArrVal_26))) (let ((.cse33 (+ (select (store .cse32 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse32 v_i_42) .cse33) (< .cse31 .cse33))))))))))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse36 (store c_A c_l v_ArrVal_26))) (let ((.cse35 (select .cse36 i))) (or (< c_min .cse35) (< .cse35 (+ 2 (select (store .cse36 v_l_29 v_ArrVal_27) 0))))))) (< v_l_29 .cse0))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse38 (store c_A c_l v_ArrVal_25))) (let ((.cse39 (store .cse38 v_l_30 v_ArrVal_26))) (let ((.cse37 (select .cse39 v_i_44))) (or (< c_min .cse37) (< v_l_29 (+ v_l_30 1)) (< (select .cse38 i) .cse37) (< .cse37 (+ (select (store .cse39 v_l_29 v_ArrVal_27) 0) 2))))))))) (< v_l_30 .cse0))))) is different from false [2024-04-07 08:00:35,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:37,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:39,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:41,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:44,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:46,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:48,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:50,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:52,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:54,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:00:56,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2)))) (.cse6 (forall ((i Int)) (<= (select c_A i) c_min))) (.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_26))) (let ((.cse0 (select .cse1 v_i_44))) (or (< .cse0 (+ 2 (select (store .cse1 v_l_29 v_ArrVal_27) 0))) (< c_min .cse0) (< v_l_29 .cse2) (< (select c_A i) .cse0))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (i Int)) (let ((.cse4 (store c_A c_l v_ArrVal_26))) (let ((.cse3 (+ 2 (select (store .cse4 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse3) (< (select c_A i) .cse3) (< (select .cse4 v_i_43) .cse3) (< v_l_29 .cse2))))) (or .cse5 .cse6) (or (< .cse2 c_i) (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1)))) (forall ((i Int)) (let ((.cse7 (select c_A i))) (or (< c_min .cse7) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse9 (store c_A c_l v_ArrVal_26))) (let ((.cse8 (select (store .cse9 v_l_29 v_ArrVal_27) 0))) (or (< .cse7 (+ 2 .cse8)) (< (select .cse9 v_i_40) (+ 3 .cse8)) (< v_l_29 .cse2)))))))) (forall ((i Int)) (let ((.cse10 (select c_A i))) (or (< c_min .cse10) (forall ((v_l_29 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse12 (store c_A c_l v_ArrVal_26))) (let ((.cse11 (select .cse12 v_i_41))) (or (< .cse10 .cse11) (< v_l_29 .cse2) (< .cse11 (+ 2 (select (store .cse12 v_l_29 v_ArrVal_27) 0)))))))))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse13 (select c_A i))) (or (< c_min .cse13) (< .cse13 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_45 Int)) (let ((.cse15 (store c_A c_l v_ArrVal_26))) (let ((.cse16 (select (store .cse15 v_l_29 v_ArrVal_27) 0))) (let ((.cse14 (+ 2 .cse16))) (or (< c_min .cse14) (< (select c_A i) .cse14) (< v_l_29 .cse2) (< (select .cse15 v_i_45) (+ 3 .cse16))))))) .cse5 (or (and (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse18 (store c_A c_l v_ArrVal_26))) (let ((.cse17 (select (store .cse18 v_l_29 v_ArrVal_27) 0))) (or (< c_min (+ 2 .cse17)) (< v_l_29 .cse2) (< (select .cse18 i) (+ 3 .cse17)))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse20 (store c_A c_l v_ArrVal_26))) (let ((.cse19 (select .cse20 i))) (or (< v_l_29 .cse2) (< c_min .cse19) (< .cse19 (+ 2 (select (store .cse20 v_l_29 v_ArrVal_27) 0))))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse22 (store c_A c_l v_ArrVal_26))) (let ((.cse21 (+ 2 (select (store .cse22 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse21) (< v_l_29 .cse2) (< (select .cse22 i) .cse21)))))) .cse6) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse23 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (< c_min .cse23) (< (select c_A i) .cse23)))) (forall ((i Int)) (let ((.cse26 (select c_A i))) (or (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse24 (store c_A c_l v_ArrVal_26))) (let ((.cse25 (+ 2 (select (store .cse24 v_l_29 v_ArrVal_27) 0)))) (or (< (select .cse24 v_i_42) .cse25) (< .cse26 .cse25) (< v_l_29 .cse2))))) (< c_min .cse26)))))) is different from false [2024-04-07 08:00:58,182 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (forall ((i Int)) (<= (select c_A i) c_min))) (.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_26))) (let ((.cse0 (select .cse1 v_i_44))) (or (< .cse0 (+ 2 (select (store .cse1 v_l_29 v_ArrVal_27) 0))) (< c_min .cse0) (< v_l_29 .cse2) (< (select c_A i) .cse0))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (i Int)) (let ((.cse4 (store c_A c_l v_ArrVal_26))) (let ((.cse3 (+ 2 (select (store .cse4 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse3) (< (select c_A i) .cse3) (< (select .cse4 v_i_43) .cse3) (< v_l_29 .cse2))))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) .cse5) (forall ((i Int)) (let ((.cse6 (select c_A i))) (or (< c_min .cse6) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse8 (store c_A c_l v_ArrVal_26))) (let ((.cse7 (select (store .cse8 v_l_29 v_ArrVal_27) 0))) (or (< .cse6 (+ 2 .cse7)) (< (select .cse8 v_i_40) (+ 3 .cse7)) (< v_l_29 .cse2)))))))) (forall ((i Int)) (let ((.cse9 (select c_A i))) (or (< c_min .cse9) (forall ((v_l_29 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse11 (store c_A c_l v_ArrVal_26))) (let ((.cse10 (select .cse11 v_i_41))) (or (< .cse9 .cse10) (< v_l_29 .cse2) (< .cse10 (+ 2 (select (store .cse11 v_l_29 v_ArrVal_27) 0)))))))))) (or (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1))) (< (+ 2 c_l) c_N)) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse12 (select c_A i))) (or (< c_min .cse12) (< .cse12 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_45 Int)) (let ((.cse14 (store c_A c_l v_ArrVal_26))) (let ((.cse15 (select (store .cse14 v_l_29 v_ArrVal_27) 0))) (let ((.cse13 (+ 2 .cse15))) (or (< c_min .cse13) (< (select c_A i) .cse13) (< v_l_29 .cse2) (< (select .cse14 v_i_45) (+ 3 .cse15))))))) (or (and (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse17 (store c_A c_l v_ArrVal_26))) (let ((.cse16 (select (store .cse17 v_l_29 v_ArrVal_27) 0))) (or (< c_min (+ 2 .cse16)) (< v_l_29 .cse2) (< (select .cse17 i) (+ 3 .cse16)))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse19 (store c_A c_l v_ArrVal_26))) (let ((.cse18 (select .cse19 i))) (or (< v_l_29 .cse2) (< c_min .cse18) (< .cse18 (+ 2 (select (store .cse19 v_l_29 v_ArrVal_27) 0))))))) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse21 (store c_A c_l v_ArrVal_26))) (let ((.cse20 (+ 2 (select (store .cse21 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse20) (< v_l_29 .cse2) (< (select .cse21 i) .cse20)))))) .cse5) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse22 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (< c_min .cse22) (< (select c_A i) .cse22)))) (forall ((i Int)) (let ((.cse25 (select c_A i))) (or (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse23 (store c_A c_l v_ArrVal_26))) (let ((.cse24 (+ 2 (select (store .cse23 v_l_29 v_ArrVal_27) 0)))) (or (< (select .cse23 v_i_42) .cse24) (< .cse25 .cse24) (< v_l_29 .cse2))))) (< c_min .cse25)))))) is different from false [2024-04-07 08:01:00,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_26))) (let ((.cse0 (+ 2 (select (store .cse1 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse0) (< (select .cse1 i) .cse0))))) (< v_l_29 .cse2))) (or (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1))) (< (+ 2 c_l) c_N)) (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse3 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ 2 (select (store .cse3 v_l_29 v_ArrVal_27) 0)))) (forall ((i Int)) (<= (select .cse3 i) c_min))))) (< v_l_29 .cse2))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse5 (store c_A c_l v_ArrVal_26))) (let ((.cse4 (select .cse5 i))) (or (< c_min .cse4) (< .cse4 (+ 2 (select (store .cse5 v_l_29 v_ArrVal_27) 0))))))) (< v_l_29 .cse2))))) is different from false [2024-04-07 08:01:14,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:16,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:18,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:23,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:25,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:27,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:29,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:31,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:46,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:48,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:50,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:52,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:54,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:56,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:01:58,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:00,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:02,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:04,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:08,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:10,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:12,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:14,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:16,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:18,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:20,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:22,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:41,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:43,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:45,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:47,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:49,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:51,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:53,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:55,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 08:02:57,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:02:59,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:01,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:04,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:06,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:08,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:10,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 08:03:12,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:54,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:56,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:03:58,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:00,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:02,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:04,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:06,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:08,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:10,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:12,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:14,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:16,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:18,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:20,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:22,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_min 1)) (.cse0 (select c_A c_i)) (.cse4 (select c_A c_l)) (.cse2 (+ c_l 1))) (and (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_i_58 Int) (v_l_30 Int)) (let ((.cse5 (store c_A c_l v_ArrVal_25))) (let ((.cse3 (store .cse5 v_l_30 v_ArrVal_26))) (let ((.cse1 (+ (select (store .cse3 v_l_29 v_ArrVal_27) 0) 2))) (or (< .cse0 .cse1) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse3 v_i_43) .cse1) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse5 v_i_58) .cse1) (< c_min .cse1)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse8 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int)) (let ((.cse7 (store .cse8 v_l_30 v_ArrVal_26))) (let ((.cse6 (select .cse7 v_subst_3))) (or (< .cse6 (+ (select (store .cse7 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse6) (< v_l_29 (+ v_l_30 1)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse8 i) .cse9)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_55 Int) (v_ArrVal_27 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse13 (store c_A c_l v_ArrVal_25))) (let ((.cse11 (store .cse13 v_l_30 v_ArrVal_26))) (let ((.cse14 (select (store .cse11 v_l_29 v_ArrVal_27) 0))) (let ((.cse10 (+ .cse14 2)) (.cse12 (+ .cse14 3))) (or (< .cse0 .cse10) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse11 v_subst_1) .cse12) (< c_min .cse10) (< (select .cse13 v_i_55) .cse12))))))) (forall ((v_i_61 Int) (v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse18 (store c_A c_l v_ArrVal_25))) (let ((.cse17 (store .cse18 v_l_30 v_ArrVal_26))) (let ((.cse16 (+ (select (store .cse17 v_l_29 v_ArrVal_27) 0) 2)) (.cse15 (select .cse18 v_i_61))) (or (< .cse15 .cse16) (< v_l_29 (+ v_l_30 1)) (< c_min .cse15) (< (select .cse17 v_i_42) .cse16) (< v_l_30 .cse2) (< .cse0 .cse15) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse21 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int)) (let ((.cse20 (store .cse21 v_l_30 v_ArrVal_26))) (let ((.cse19 (+ (select (store .cse20 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< c_min .cse19) (< (select .cse20 v_subst_2) .cse19))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse21 i) .cse9)))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse23 (store c_A c_l v_ArrVal_26))) (let ((.cse22 (+ 2 (select (store .cse23 v_l_29 v_ArrVal_27) 0)))) (or (< c_min .cse22) (< (select .cse23 i) .cse22))))) (< v_l_29 .cse2))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse27 (store c_A c_l v_ArrVal_25))) (let ((.cse26 (select .cse27 i))) (or (forall ((v_l_29 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse25 (store .cse27 v_l_30 v_ArrVal_26))) (let ((.cse24 (select .cse25 v_i_41))) (or (< .cse24 (+ (select (store .cse25 v_l_29 v_ArrVal_27) 0) 2)) (< .cse26 .cse24) (< v_l_29 (+ v_l_30 1)))))) (< c_min .cse26))))))))) (or (and (not (= c_l 0)) (<= c_min (+ (select c_A 0) 1))) (< (+ 2 c_l) c_N)) (or (and (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_5 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse31 (store c_A c_l v_ArrVal_25))) (let ((.cse28 (store .cse31 v_l_30 v_ArrVal_26))) (let ((.cse30 (select (store .cse28 v_l_29 v_ArrVal_27) 0))) (let ((.cse29 (+ .cse30 3))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse28 v_subst_1) .cse29) (< c_min (+ .cse30 2)) (< (select .cse31 v_subst_5) .cse29))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_6 Int) (v_i_45 Int) (v_l_30 Int)) (let ((.cse32 (store c_A c_l v_ArrVal_25))) (let ((.cse34 (store .cse32 v_l_30 v_ArrVal_26))) (let ((.cse35 (select (store .cse34 v_l_29 v_ArrVal_27) 0))) (let ((.cse33 (+ .cse35 2))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse32 v_subst_6) .cse33) (< (select .cse34 v_i_45) (+ .cse35 3)) (< c_min .cse33))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_subst_11 Int) (v_l_30 Int)) (let ((.cse37 (store c_A c_l v_ArrVal_25))) (let ((.cse38 (store .cse37 v_l_30 v_ArrVal_26))) (let ((.cse36 (select .cse38 v_i_44))) (or (< c_min .cse36) (< v_l_29 (+ v_l_30 1)) (< (select .cse37 v_subst_11) .cse36) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse36 (+ (select (store .cse38 v_l_29 v_ArrVal_27) 0) 2))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_subst_4 Int) (v_l_30 Int)) (let ((.cse41 (store c_A c_l v_ArrVal_25))) (let ((.cse39 (store .cse41 v_l_30 v_ArrVal_26))) (let ((.cse40 (+ (select (store .cse39 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse39 v_i_43) .cse40) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse40) (< (select .cse41 v_subst_4) .cse40)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_subst_10 Int) (v_l_30 Int)) (let ((.cse44 (store c_A c_l v_ArrVal_25))) (let ((.cse43 (store .cse44 v_l_30 v_ArrVal_26))) (let ((.cse42 (select .cse43 v_subst_3))) (or (< .cse42 (+ (select (store .cse43 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse42) (< (select .cse44 v_subst_10) (+ .cse42 1)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_7 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse45 (store c_A c_l v_ArrVal_25))) (let ((.cse48 (store .cse45 v_l_30 v_ArrVal_26))) (let ((.cse46 (select (store .cse48 v_l_29 v_ArrVal_27) 0))) (let ((.cse47 (+ .cse46 2))) (or (< (select .cse45 v_subst_7) (+ .cse46 3)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse47) (< (select .cse48 v_subst_2) .cse47))))))) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_subst_8 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse52 (store c_A c_l v_ArrVal_25))) (let ((.cse51 (store .cse52 v_l_30 v_ArrVal_26))) (let ((.cse50 (select (store .cse51 v_l_29 v_ArrVal_27) 0)) (.cse49 (select .cse52 v_subst_8))) (or (< v_l_29 (+ v_l_30 1)) (< .cse49 (+ .cse50 2)) (< v_l_30 .cse2) (< (select .cse51 v_i_40) (+ .cse50 3)) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse49)))))) (forall ((v_subst_12 Int) (v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse56 (store c_A c_l v_ArrVal_25))) (let ((.cse53 (store .cse56 v_l_30 v_ArrVal_26))) (let ((.cse55 (select .cse56 v_subst_12)) (.cse54 (+ (select (store .cse53 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse53 v_i_42) .cse54) (< v_l_30 .cse2) (< c_min .cse55) (< .cse55 .cse54) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_subst_9 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse60 (store c_A c_l v_ArrVal_25))) (let ((.cse58 (store .cse60 v_l_30 v_ArrVal_26))) (let ((.cse59 (select .cse60 v_subst_9)) (.cse57 (select .cse58 v_i_41))) (or (< .cse57 (+ (select (store .cse58 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< c_min .cse59) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse59 .cse57))))))) (< .cse0 .cse9)) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (i Int)) (let ((.cse61 (store c_A c_l v_ArrVal_25))) (let ((.cse63 (store .cse61 v_l_30 v_ArrVal_26))) (let ((.cse62 (+ (select (store .cse63 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse61 i) .cse62) (< (select .cse63 v_i_43) .cse62) (< c_min .cse62)))))))) (< v_l_30 .cse2))) (forall ((v_i_62 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_l_30 Int)) (let ((.cse66 (store c_A c_l v_ArrVal_25))) (let ((.cse65 (store .cse66 v_l_30 v_ArrVal_26))) (let ((.cse64 (select .cse65 v_subst_3))) (or (< .cse64 (+ (select (store .cse65 v_l_29 v_ArrVal_27) 0) 2)) (< c_min .cse64) (< v_l_29 (+ v_l_30 1)) (< (select .cse66 v_i_62) (+ .cse64 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse64)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_i_57 Int) (v_l_30 Int)) (let ((.cse68 (store c_A c_l v_ArrVal_25))) (let ((.cse69 (store .cse68 v_l_30 v_ArrVal_26))) (let ((.cse67 (select .cse69 v_i_44))) (or (< c_min .cse67) (< v_l_29 (+ v_l_30 1)) (< (select .cse68 v_i_57) .cse67) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse67 (+ (select (store .cse69 v_l_29 v_ArrVal_27) 0) 2)) (< .cse0 .cse67)))))) (or (< c_min .cse0) (and (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_69 Int) (v_l_30 Int)) (let ((.cse73 (store c_A c_l v_ArrVal_25))) (let ((.cse70 (store .cse73 v_l_30 v_ArrVal_26))) (let ((.cse72 (select .cse73 v_i_69)) (.cse71 (+ (select (store .cse70 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse70 v_i_42) .cse71) (< v_l_30 .cse2) (< .cse0 .cse72) (< (+ v_ArrVal_25 1) .cse4) (< .cse72 .cse71)))))) (forall ((v_l_29 Int) (v_i_64 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse75 (store c_A c_l v_ArrVal_25))) (let ((.cse77 (store .cse75 v_l_30 v_ArrVal_26))) (let ((.cse76 (select (store .cse77 v_l_29 v_ArrVal_27) 0))) (let ((.cse74 (+ .cse76 2))) (or (< .cse0 .cse74) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse75 v_i_64) (+ .cse76 3)) (< (select .cse77 v_subst_2) .cse74))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_66 Int) (v_ArrVal_27 Int) (v_subst_3 Int) (v_l_30 Int)) (let ((.cse80 (store c_A c_l v_ArrVal_25))) (let ((.cse79 (store .cse80 v_l_30 v_ArrVal_26))) (let ((.cse78 (select .cse79 v_subst_3))) (or (< .cse78 (+ (select (store .cse79 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse80 v_i_66) (+ .cse78 1)) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse78)))))) (forall ((v_i_71 Int) (v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse84 (store c_A c_l v_ArrVal_25))) (let ((.cse83 (store .cse84 v_l_30 v_ArrVal_26))) (let ((.cse81 (select .cse84 v_i_71)) (.cse82 (select (store .cse83 v_l_29 v_ArrVal_27) 0))) (or (< .cse0 .cse81) (< v_l_29 (+ v_l_30 1)) (< .cse81 (+ .cse82 2)) (< v_l_30 .cse2) (< (select .cse83 v_i_40) (+ .cse82 3)) (< (+ v_ArrVal_25 1) .cse4)))))) (forall ((v_i_72 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse85 (store c_A c_l v_ArrVal_25))) (let ((.cse87 (store .cse85 v_l_30 v_ArrVal_26))) (let ((.cse86 (select .cse87 v_i_44))) (or (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse85 v_i_72) .cse86) (< .cse86 (+ (select (store .cse87 v_l_29 v_ArrVal_27) 0) 2)) (< .cse0 .cse86)))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_68 Int) (v_subst_1 Int) (v_l_30 Int)) (let ((.cse91 (store c_A c_l v_ArrVal_25))) (let ((.cse89 (store .cse91 v_l_30 v_ArrVal_26))) (let ((.cse88 (select (store .cse89 v_l_29 v_ArrVal_27) 0))) (let ((.cse90 (+ .cse88 3))) (or (< .cse0 (+ .cse88 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse89 v_subst_1) .cse90) (< (select .cse91 v_i_68) .cse90))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_65 Int) (v_i_45 Int) (v_l_30 Int)) (let ((.cse93 (store c_A c_l v_ArrVal_25))) (let ((.cse94 (store .cse93 v_l_30 v_ArrVal_26))) (let ((.cse95 (select (store .cse94 v_l_29 v_ArrVal_27) 0))) (let ((.cse92 (+ .cse95 2))) (or (< .cse0 .cse92) (< (select .cse93 v_i_65) .cse92) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse94 v_i_45) (+ .cse95 3)))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_67 Int) (v_l_30 Int)) (let ((.cse99 (store c_A c_l v_ArrVal_25))) (let ((.cse97 (store .cse99 v_l_30 v_ArrVal_26))) (let ((.cse98 (select .cse99 v_i_67)) (.cse96 (select .cse97 v_i_41))) (or (< .cse96 (+ (select (store .cse97 v_l_29 v_ArrVal_27) 0) 2)) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse98) (< .cse98 .cse96)))))) (forall ((v_i_70 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_l_30 Int)) (let ((.cse101 (store c_A c_l v_ArrVal_25))) (let ((.cse102 (store .cse101 v_l_30 v_ArrVal_26))) (let ((.cse100 (+ (select (store .cse102 v_l_29 v_ArrVal_27) 0) 2))) (or (< .cse0 .cse100) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse101 v_i_70) .cse100) (< (select .cse102 v_i_43) .cse100) (< (+ v_ArrVal_25 1) .cse4)))))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse103 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ 2 (select (store .cse103 v_l_29 v_ArrVal_27) 0)))) (forall ((i Int)) (<= (select .cse103 i) c_min))))) (< v_l_29 .cse2))) (forall ((v_i_60 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_2 Int) (v_l_30 Int)) (let ((.cse105 (store c_A c_l v_ArrVal_25))) (let ((.cse107 (store .cse105 v_l_30 v_ArrVal_26))) (let ((.cse106 (select (store .cse107 v_l_29 v_ArrVal_27) 0))) (let ((.cse104 (+ .cse106 2))) (or (< .cse0 .cse104) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse105 v_i_60) (+ .cse106 3)) (< c_min .cse104) (< (select .cse107 v_subst_2) .cse104))))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse111 (store c_A c_l v_ArrVal_25))) (let ((.cse108 (select .cse111 i))) (or (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse110 (store .cse111 v_l_30 v_ArrVal_26))) (let ((.cse109 (select (store .cse110 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< .cse108 (+ .cse109 2)) (< (select .cse110 v_i_40) (+ .cse109 3)))))) (< c_min .cse108))))))))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_45 Int)) (let ((.cse112 (store c_A c_l v_ArrVal_25))) (let ((.cse114 (store .cse112 v_l_30 v_ArrVal_26))) (let ((.cse115 (select (store .cse114 v_l_29 v_ArrVal_27) 0))) (let ((.cse113 (+ .cse115 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse112 i) .cse113) (< (select .cse114 v_i_45) (+ .cse115 3)) (< c_min .cse113))))))) (< (+ v_ArrVal_25 1) .cse4))) (< v_l_30 .cse2))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_45 Int) (v_i_56 Int) (v_l_30 Int)) (let ((.cse117 (store c_A c_l v_ArrVal_25))) (let ((.cse118 (store .cse117 v_l_30 v_ArrVal_26))) (let ((.cse119 (select (store .cse118 v_l_29 v_ArrVal_27) 0))) (let ((.cse116 (+ .cse119 2))) (or (< .cse0 .cse116) (< v_l_29 (+ v_l_30 1)) (< v_l_30 .cse2) (< (select .cse117 v_i_56) .cse116) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse118 v_i_45) (+ .cse119 3)) (< c_min .cse116))))))) (forall ((v_l_29 Int) (v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_59 Int) (v_l_30 Int)) (let ((.cse123 (store c_A c_l v_ArrVal_25))) (let ((.cse121 (store .cse123 v_l_30 v_ArrVal_26))) (let ((.cse120 (select .cse121 v_i_41)) (.cse122 (select .cse123 v_i_59))) (or (< .cse120 (+ (select (store .cse121 v_l_29 v_ArrVal_27) 0) 2)) (< .cse122 .cse120) (< v_l_29 (+ v_l_30 1)) (< .cse0 .cse122) (< v_l_30 .cse2) (< (+ v_ArrVal_25 1) .cse4) (< c_min .cse122)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse126 (store c_A c_l v_ArrVal_25))) (or (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_1 Int)) (let ((.cse124 (store .cse126 v_l_30 v_ArrVal_26))) (let ((.cse125 (select (store .cse124 v_l_29 v_ArrVal_27) 0))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse124 v_subst_1) (+ .cse125 3)) (< c_min (+ .cse125 2)))))) (< (+ v_ArrVal_25 1) .cse4) (< (select .cse126 i) .cse9)))))) (forall ((v_i_40 Int) (v_l_29 Int) (v_ArrVal_25 Int) (v_i_63 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_30 Int)) (let ((.cse130 (store c_A c_l v_ArrVal_25))) (let ((.cse129 (store .cse130 v_l_30 v_ArrVal_26))) (let ((.cse128 (select (store .cse129 v_l_29 v_ArrVal_27) 0)) (.cse127 (select .cse130 v_i_63))) (or (< .cse127 (+ .cse128 2)) (< v_l_29 (+ v_l_30 1)) (< c_min .cse127) (< v_l_30 .cse2) (< (select .cse129 v_i_40) (+ .cse128 3)) (< (+ v_ArrVal_25 1) .cse4) (< .cse0 .cse127)))))) (forall ((v_l_30 Int)) (or (< v_l_30 .cse2) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((i Int)) (let ((.cse134 (store c_A c_l v_ArrVal_25))) (let ((.cse131 (select .cse134 i))) (or (< c_min .cse131) (forall ((v_l_29 Int) (v_i_42 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int)) (let ((.cse132 (store .cse134 v_l_30 v_ArrVal_26))) (let ((.cse133 (+ (select (store .cse132 v_l_29 v_ArrVal_27) 0) 2))) (or (< v_l_29 (+ v_l_30 1)) (< (select .cse132 v_i_42) .cse133) (< .cse131 .cse133))))))))))))) (forall ((v_l_29 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse136 (store c_A c_l v_ArrVal_26))) (let ((.cse135 (select .cse136 i))) (or (< c_min .cse135) (< .cse135 (+ 2 (select (store .cse136 v_l_29 v_ArrVal_27) 0))))))) (< v_l_29 .cse2))) (forall ((v_l_30 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse4) (forall ((v_l_29 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse138 (store c_A c_l v_ArrVal_25))) (let ((.cse139 (store .cse138 v_l_30 v_ArrVal_26))) (let ((.cse137 (select .cse139 v_i_44))) (or (< c_min .cse137) (< v_l_29 (+ v_l_30 1)) (< (select .cse138 i) .cse137) (< .cse137 (+ (select (store .cse139 v_l_29 v_ArrVal_27) 0) 2))))))))) (< v_l_30 .cse2))))) is different from false [2024-04-07 08:04:24,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:26,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:28,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:30,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:32,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-07 08:04:34,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:36,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-04-07 08:04:38,285 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 [2024-04-07 08:04:38,286 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-07 08:04:39,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-07 08:04:39,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-07 08:04:39,488 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-07 08:04:39,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-04-07 08:04:39,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-04-07 08:04:39,552 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-07 08:04:39,553 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2024-04-07 08:04:39,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-07 08:04:39,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-07 08:04:39,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-07 08:04:39,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-07 08:04:39,557 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1] [2024-04-07 08:04:39,559 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-07 08:04:39,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-07 08:04:39,579 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:04:39 BasicIcfg [2024-04-07 08:04:39,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-07 08:04:39,579 INFO L158 Benchmark]: Toolchain (without parser) took 876208.27ms. Allocated memory was 219.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 191.9MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 904.7MB. Max. memory is 8.0GB. [2024-04-07 08:04:39,579 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-07 08:04:39,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 219.2MB. Free memory was 191.9MB in the beginning and 190.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-07 08:04:39,579 INFO L158 Benchmark]: Boogie Preprocessor took 25.09ms. Allocated memory is still 219.2MB. Free memory was 190.3MB in the beginning and 189.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-07 08:04:39,579 INFO L158 Benchmark]: RCFGBuilder took 238.03ms. Allocated memory is still 219.2MB. Free memory was 189.1MB in the beginning and 178.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-07 08:04:39,579 INFO L158 Benchmark]: TraceAbstraction took 875889.57ms. Allocated memory was 219.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 177.2MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 891.1MB. Max. memory is 8.0GB. [2024-04-07 08:04:39,580 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.09ms. Allocated memory is still 162.5MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 219.2MB. Free memory was 191.9MB in the beginning and 190.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.09ms. Allocated memory is still 219.2MB. Free memory was 190.3MB in the beginning and 189.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.03ms. Allocated memory is still 219.2MB. Free memory was 189.1MB in the beginning and 178.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 875889.57ms. Allocated memory was 219.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 177.2MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 891.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4736211, independent: 4046028, independent conditional: 4045779, independent unconditional: 249, dependent: 690181, dependent conditional: 690123, dependent unconditional: 58, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4126174, independent: 4046028, independent conditional: 4045779, independent unconditional: 249, dependent: 80144, dependent conditional: 80144, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4126174, independent: 4046028, independent conditional: 4045779, independent unconditional: 249, dependent: 80144, dependent conditional: 80144, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4126174, independent: 4046028, independent conditional: 4045779, independent unconditional: 249, dependent: 80144, dependent conditional: 80144, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 384563, independent unconditional: 3661465, dependent: 696196, dependent conditional: 491816, dependent unconditional: 204380, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 367028, independent unconditional: 3679000, dependent: 696196, dependent conditional: 414074, dependent unconditional: 282122, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 367028, independent unconditional: 3679000, dependent: 696196, dependent conditional: 414074, dependent unconditional: 282122, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 383, independent conditional: 123, independent unconditional: 260, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 487, dependent conditional: 0, dependent unconditional: 487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 487, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 487, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1935, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 751, dependent conditional: 682, dependent unconditional: 69, unknown: 1015, unknown conditional: 1015, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4742226, independent: 4045645, independent conditional: 366905, independent unconditional: 3678740, dependent: 695817, dependent conditional: 413709, dependent unconditional: 282108, unknown: 764, unknown conditional: 490, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 383, Positive conditional cache size: 123, Positive unconditional cache size: 260, Negative cache size: 379, Negative conditional cache size: 365, Negative unconditional cache size: 14, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 95277, Maximal queried relation: 12, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 384563, independent unconditional: 3661465, dependent: 696196, dependent conditional: 491816, dependent unconditional: 204380, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 367028, independent unconditional: 3679000, dependent: 696196, dependent conditional: 414074, dependent unconditional: 282122, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4742226, independent: 4046028, independent conditional: 367028, independent unconditional: 3679000, dependent: 696196, dependent conditional: 414074, dependent unconditional: 282122, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 383, independent conditional: 123, independent unconditional: 260, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 487, dependent conditional: 0, dependent unconditional: 487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 487, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 487, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 379, dependent conditional: 365, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1935, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 751, dependent conditional: 682, dependent unconditional: 69, unknown: 1015, unknown conditional: 1015, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4742226, independent: 4045645, independent conditional: 366905, independent unconditional: 3678740, dependent: 695817, dependent conditional: 413709, dependent unconditional: 282108, unknown: 764, unknown conditional: 490, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 383, Positive conditional cache size: 123, Positive unconditional cache size: 260, Negative cache size: 379, Negative conditional cache size: 365, Negative unconditional cache size: 14, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 95277 ], Independence queries for same thread: 610037 - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 56 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 875.7s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 782.4s, 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: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 90.6s InterpolantComputationTime, 513 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 660 ConstructedInterpolants, 28 QuantifiedInterpolants, 18936 SizeOfPredicates, 24 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 90/200 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown