java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:13:33,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:13:33,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:13:33,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:13:33,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:13:33,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:13:33,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:13:33,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:13:33,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:13:33,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:13:33,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:13:33,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:13:33,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:13:33,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:13:33,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:13:33,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:13:33,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:13:33,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:13:33,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:13:33,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:13:33,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:13:33,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:13:33,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:13:33,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:13:33,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:13:33,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:13:33,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:13:33,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:13:33,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:13:33,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:13:33,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:13:33,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:13:33,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:13:33,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:13:33,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:13:33,250 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:13:33,250 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:13:33,267 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:13:33,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:13:33,268 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:13:33,268 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:13:33,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:13:33,270 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:13:33,270 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:13:33,270 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:13:33,270 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:13:33,271 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:13:33,271 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:13:33,271 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:13:33,272 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:13:33,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:13:33,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:13:33,273 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:13:33,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:13:33,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:13:33,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:13:33,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:13:33,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:13:33,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:13:33,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:13:33,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:13:33,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:13:33,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:13:33,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:13:33,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:13:33,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:13:33,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:13:33,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:13:33,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:13:33,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:13:33,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:13:33,279 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:13:33,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:13:33,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:13:33,281 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:13:33,281 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:13:33,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:13:33,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:13:33,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:13:33,357 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:13:33,358 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:13:33,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-12-24 14:13:33,359 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-24 14:13:33,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:13:33,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:13:33,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:13:33,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:13:33,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:13:33,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:13:33,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:13:33,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:13:33,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:13:33,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:13:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 14:13:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 14:13:33,880 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 14:13:33,880 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-24 14:13:33,881 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33 BoogieIcfgContainer [2018-12-24 14:13:33,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:13:33,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:13:33,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:13:33,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:13:33,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/2) ... [2018-12-24 14:13:33,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe4d657 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:13:33, skipping insertion in model container [2018-12-24 14:13:33,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33" (2/2) ... [2018-12-24 14:13:33,889 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-24 14:13:33,900 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:13:33,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:13:33,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:13:33,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:13:33,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:13:33,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:13:33,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:13:33,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:13:33,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:13:33,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:13:33,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:13:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-24 14:13:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:13:33,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:33,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:13:33,984 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-24 14:13:33,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:13:34,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:13:34,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:13:34,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:13:34,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:13:34,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:13:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,190 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-24 14:13:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:34,274 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-24 14:13:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:13:34,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 14:13:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:34,288 INFO L225 Difference]: With dead ends: 11 [2018-12-24 14:13:34,289 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 14:13:34,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 14:13:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 14:13:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:13:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-24 14:13:34,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-24 14:13:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:34,326 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-24 14:13:34,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:13:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-24 14:13:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:13:34,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:34,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:13:34,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-24 14:13:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:34,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:34,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:13:34,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:34,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:34,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 14:13:34,494 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-24 14:13:34,563 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:13:34,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:13:40,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-24 14:13:40,481 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:13:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:40,493 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-24 14:13:40,732 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-24 14:13:40,733 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-24 14:13:40,794 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-24 14:13:40,795 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-24 14:13:40,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:13:40,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-24 14:13:40,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:13:40,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:13:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:13:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-24 14:13:40,799 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-24 14:13:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:41,140 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-24 14:13:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:13:41,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 14:13:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:41,142 INFO L225 Difference]: With dead ends: 11 [2018-12-24 14:13:41,143 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 14:13:41,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-24 14:13:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 14:13:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-24 14:13:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 14:13:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-24 14:13:41,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-12-24 14:13:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:41,148 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-24 14:13:41,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:13:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-24 14:13:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:13:41,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:41,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:13:41,150 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2018-12-24 14:13:41,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:13:41,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:41,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 14:13:41,241 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2018-12-24 14:13:41,242 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:13:41,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:13:44,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-24 14:13:44,361 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:13:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:44,362 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-24 14:13:44,621 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 30.56% of their original sizes. [2018-12-24 14:13:44,622 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-24 14:13:46,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse3 (* 2 c_~n)) (.cse1 (+ v_b_49_2 v_v_641_2)) (.cse7 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse8 (+ v_v_641_2 c_~n)) (.cse4 (* 2 v_b_50_2)) (.cse6 (+ v_b_49_2 5)) (.cse13 (+ v_b_49_2 c_~n)) (.cse12 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse10 (+ v_b_50_2 c_ULTIMATE.start_main_~i~7)) (.cse5 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse2 (+ v_b_50_2 v_v_641_2)) (.cse15 (+ v_b_50_2 c_~n)) (.cse0 (+ c_ULTIMATE.start_main_~i~7 1)) (.cse11 (+ v_v_641_2 5)) (.cse9 (+ v_b_50_2 v_b_49_2)) (.cse14 (* 2 v_b_49_2)) (.cse16 (* 2 v_v_641_2))) (and (<= .cse0 c_~n) (<= v_v_641_2 v_b_49_2) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_49_2) 4) (or (= v_v_641_2 (select c_~array v_idx_62)) (< v_idx_62 v_b_49_2) (<= v_b_50_2 v_idx_62)) (or (<= v_b_49_2 v_idx_61) (= v_v_640_2 (select c_~array v_idx_61))) (<= .cse1 0) (<= .cse2 5) (<= .cse3 10) (<= .cse4 10) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_641_2) 4) (<= .cse5 9) (<= c_~n .cse6) (<= .cse7 8) (<= v_b_50_2 .cse6) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_49_2 1)) (<= .cse8 5) (<= 10 .cse3) (<= 0 .cse1) (<= 0 (+ .cse7 2)) (<= 5 .cse9) (<= v_b_50_2 c_~n) (<= v_b_49_2 v_v_641_2) (<= .cse10 9) (<= v_b_49_2 .cse0) (<= c_~n .cse11) (<= 5 .cse8) (<= c_~n .cse12) (<= 10 .cse4) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_641_2 4)) (<= 5 .cse13) (<= .cse6 v_b_50_2) (<= .cse6 c_~n) (<= .cse13 5) (<= v_b_50_2 .cse12) (<= 4 .cse10) (<= v_b_50_2 .cse11) (<= 0 .cse14) (<= 4 .cse5) (<= .cse0 v_b_50_2) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_641_2 1)) (<= .cse15 10) (<= 5 .cse2) (<= .cse16 0) (<= .cse11 c_~n) (or (< v_idx_63 v_b_50_2) (= v_v_642_2 (select c_~array v_idx_63))) (<= 10 .cse15) (<= v_v_641_2 .cse0) (<= c_~n v_b_50_2) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_49_2 4)) (<= .cse11 v_b_50_2) (<= .cse9 5) (<= .cse14 0) (<= 0 .cse16))))) is different from false [2018-12-24 14:13:48,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_65 Int) (v_idx_66 Int) (v_idx_64 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse3 (* 2 c_~n)) (.cse1 (+ v_b_49_2 v_v_641_2)) (.cse7 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse8 (+ v_v_641_2 c_~n)) (.cse4 (* 2 v_b_50_2)) (.cse6 (+ v_b_49_2 5)) (.cse13 (+ v_b_49_2 c_~n)) (.cse12 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse10 (+ v_b_50_2 c_ULTIMATE.start_main_~i~7)) (.cse5 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse2 (+ v_b_50_2 v_v_641_2)) (.cse15 (+ v_b_50_2 c_~n)) (.cse0 (+ c_ULTIMATE.start_main_~i~7 1)) (.cse11 (+ v_v_641_2 5)) (.cse9 (+ v_b_50_2 v_b_49_2)) (.cse14 (* 2 v_b_49_2)) (.cse16 (* 2 v_v_641_2))) (and (<= .cse0 c_~n) (<= v_v_641_2 v_b_49_2) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_49_2) 4) (<= .cse1 0) (<= .cse2 5) (<= .cse3 10) (<= .cse4 10) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_641_2) 4) (<= .cse5 9) (<= c_~n .cse6) (<= .cse7 8) (or (<= v_b_50_2 v_idx_65) (< v_idx_65 v_b_49_2) (= v_v_641_2 (select c_~array v_idx_65))) (<= v_b_50_2 .cse6) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_49_2 1)) (<= .cse8 5) (<= 10 .cse3) (<= 0 .cse1) (<= 0 (+ .cse7 2)) (<= 5 .cse9) (<= v_b_50_2 c_~n) (<= v_b_49_2 v_v_641_2) (<= .cse10 9) (<= v_b_49_2 .cse0) (<= c_~n .cse11) (<= 5 .cse8) (<= c_~n .cse12) (<= 10 .cse4) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_641_2 4)) (or (= v_v_640_2 (select c_~array v_idx_64)) (<= v_b_49_2 v_idx_64)) (<= 5 .cse13) (<= .cse6 v_b_50_2) (<= .cse6 c_~n) (<= .cse13 5) (<= v_b_50_2 .cse12) (<= 4 .cse10) (<= v_b_50_2 .cse11) (<= 0 .cse14) (<= 4 .cse5) (<= .cse0 v_b_50_2) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_641_2 1)) (<= .cse15 10) (or (< v_idx_66 v_b_50_2) (= v_v_642_2 (select c_~array v_idx_66))) (<= 5 .cse2) (<= .cse16 0) (<= .cse11 c_~n) (<= 10 .cse15) (<= v_v_641_2 .cse0) (<= c_~n v_b_50_2) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_49_2 4)) (<= .cse11 v_b_50_2) (<= .cse9 5) (<= .cse14 0) (<= 0 .cse16))))) is different from false [2018-12-24 14:13:50,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse5 (* 2 c_~n)) (.cse3 (+ v_b_49_2 v_v_641_2)) (.cse9 (+ v_v_641_2 c_~n)) (.cse6 (* 2 v_b_50_2)) (.cse10 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (.cse8 (+ v_b_49_2 5)) (.cse13 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2)) (.cse14 (+ v_b_49_2 c_~n)) (.cse0 (+ c_ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse4 (+ v_b_50_2 v_v_641_2)) (.cse7 (+ v_b_50_2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse16 (+ v_b_50_2 c_~n)) (.cse12 (+ v_v_641_2 5)) (.cse1 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2)) (.cse2 (* 2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse11 (+ v_b_50_2 v_b_49_2)) (.cse15 (* 2 v_b_49_2)) (.cse17 (* 2 v_v_641_2))) (and (or (< v_idx_68 v_b_49_2) (<= v_b_50_2 v_idx_68) (= v_v_641_2 (select c_~array v_idx_68))) (<= v_v_641_2 v_b_49_2) (<= c_~n .cse0) (<= 0 .cse1) (or (< v_idx_69 v_b_50_2) (= v_v_642_2 (select c_~array v_idx_69))) (<= .cse2 0) (<= .cse3 0) (<= .cse4 5) (<= .cse5 10) (<= .cse6 10) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2) (<= .cse7 5) (<= c_~n .cse8) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2) (<= v_b_50_2 .cse8) (<= .cse0 v_b_50_2) (<= .cse9 5) (<= 5 .cse10) (<= 10 .cse5) (<= 0 .cse3) (<= 5 .cse11) (<= v_b_50_2 c_~n) (<= v_b_49_2 v_v_641_2) (<= c_~n .cse12) (<= 5 .cse9) (<= 0 .cse13) (<= 10 .cse6) (<= .cse10 5) (<= 5 .cse14) (<= .cse8 v_b_50_2) (<= .cse8 c_~n) (<= .cse13 0) (<= .cse14 5) (<= .cse0 c_~n) (<= v_b_50_2 .cse12) (<= 0 .cse15) (<= .cse16 10) (<= v_b_50_2 .cse0) (<= v_v_641_2 c_ULTIMATE.start_SelectionSort_~lh~4) (<= 5 .cse4) (<= .cse17 0) (<= .cse12 c_~n) (<= 5 .cse7) (<= v_b_49_2 c_ULTIMATE.start_SelectionSort_~lh~4) (<= 10 .cse16) (or (<= v_b_49_2 v_idx_67) (= v_v_640_2 (select c_~array v_idx_67))) (<= c_~n v_b_50_2) (<= .cse12 v_b_50_2) (<= .cse1 0) (<= 0 .cse2) (<= .cse11 5) (<= .cse15 0) (<= 0 .cse17))))) is different from false [2018-12-24 14:13:52,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_72 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse12 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse18 (+ v_b_50_2 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse19 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2)) (.cse22 (+ v_b_49_2 1)) (.cse4 (+ v_b_50_2 v_v_641_2)) (.cse15 (+ v_b_50_2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse13 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse11 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (.cse27 (* 2 v_v_641_2)) (.cse25 (+ c_ULTIMATE.start_SelectionSort_~i~4 v_v_641_2)) (.cse14 (+ v_b_49_2 v_v_641_2)) (.cse26 (+ v_v_641_2 1)) (.cse17 (+ v_v_641_2 c_~n)) (.cse20 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (.cse31 (* 2 c_~n)) (.cse24 (+ c_ULTIMATE.start_SelectionSort_~i~4 4)) (.cse21 (+ v_b_49_2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse6 (+ v_v_641_2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse10 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse5 (* 2 v_b_50_2)) (.cse9 (+ v_b_49_2 5)) (.cse33 (+ v_b_49_2 c_~n)) (.cse0 (+ c_ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse23 (+ c_ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse29 (* 2 v_b_49_2)) (.cse28 (+ v_b_50_2 c_~n)) (.cse35 (+ v_b_49_2 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse2 (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse30 (* 2 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse7 (+ c_ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse8 (+ v_b_50_2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse34 (* 2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse32 (+ v_v_641_2 5)) (.cse1 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2)) (.cse3 (* 2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse16 (+ v_b_50_2 v_b_49_2)) (.cse36 (+ c_ULTIMATE.start_SelectionSort_~rh~4 c_~n))) (and (<= v_v_641_2 v_b_49_2) (<= c_~n .cse0) (<= 0 .cse1) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse2) (or (= v_v_642_2 (select c_~array v_idx_72)) (< v_idx_72 v_b_50_2)) (<= .cse3 0) (<= .cse4 5) (<= .cse5 10) (<= .cse6 0) (<= v_b_50_2 .cse7) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2) (<= .cse8 5) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_v_641_2) (<= v_b_50_2 .cse9) (<= 0 .cse10) (<= .cse11 6) (<= .cse12 1) (<= .cse13 1) (<= 0 .cse14) (<= .cse15 5) (<= 5 .cse16) (<= v_b_49_2 v_v_641_2) (<= 5 .cse17) (<= 6 .cse18) (<= 1 .cse12) (<= 0 .cse19) (<= c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse18 6) (<= .cse20 5) (<= .cse21 0) (<= .cse22 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse23 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse19 0) (<= .cse24 v_b_50_2) (<= .cse7 c_~n) (<= 1 .cse25) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse22) (<= v_b_50_2 .cse0) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse26) (<= 5 .cse4) (<= .cse27 0) (<= c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_50_2 .cse24) (<= 10 .cse28) (<= 5 .cse15) (<= 1 .cse13) (<= c_~n v_b_50_2) (<= 6 .cse11) (<= .cse29 0) (<= 2 .cse30) (<= 0 .cse27) (<= .cse25 1) (<= .cse14 0) (<= .cse31 10) (<= .cse26 c_ULTIMATE.start_SelectionSort_~i~4) (<= c_~n .cse24) (<= c_~n .cse9) (<= .cse0 v_b_50_2) (<= .cse17 5) (<= 5 .cse20) (<= 10 .cse31) (<= .cse24 c_~n) (<= 0 .cse21) (<= 0 .cse6) (<= v_b_50_2 c_~n) (<= .cse10 0) (<= c_~n .cse32) (<= 10 .cse5) (<= 5 .cse33) (<= .cse9 v_b_50_2) (<= .cse9 c_~n) (<= .cse34 0) (<= .cse33 5) (or (<= v_b_49_2 v_idx_70) (= v_v_640_2 (select c_~array v_idx_70))) (<= .cse0 c_~n) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse23) (<= v_b_50_2 .cse32) (<= 0 .cse29) (<= 1 .cse35) (<= 5 .cse36) (<= .cse28 10) (<= v_v_641_2 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse35 1) (<= v_v_641_2 c_ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_49_2 c_ULTIMATE.start_SelectionSort_~rh~4) (<= c_~n .cse7) (<= .cse2 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse32 c_~n) (<= .cse30 2) (<= .cse7 v_b_50_2) (<= 5 .cse8) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_b_49_2) (<= v_b_49_2 c_ULTIMATE.start_SelectionSort_~lh~4) (<= 0 .cse34) (<= .cse32 v_b_50_2) (<= .cse1 0) (<= 0 .cse3) (or (<= v_b_50_2 v_idx_71) (= v_v_641_2 (select c_~array v_idx_71)) (< v_idx_71 v_b_49_2)) (<= .cse16 5) (<= .cse36 5))))) is different from false [2018-12-24 14:13:53,002 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-24 14:13:53,002 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-24 14:13:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:13:53,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2018-12-24 14:13:53,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:13:53,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 14:13:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 14:13:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=7, Unknown=4, NotChecked=20, Total=42 [2018-12-24 14:13:53,004 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2018-12-24 14:13:55,281 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse3 (* 2 c_~n)) (.cse1 (+ v_b_49_2 v_v_641_2)) (.cse7 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse8 (+ v_v_641_2 c_~n)) (.cse4 (* 2 v_b_50_2)) (.cse6 (+ v_b_49_2 5)) (.cse13 (+ v_b_49_2 c_~n)) (.cse12 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse10 (+ v_b_50_2 c_ULTIMATE.start_main_~i~7)) (.cse5 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse2 (+ v_b_50_2 v_v_641_2)) (.cse15 (+ v_b_50_2 c_~n)) (.cse0 (+ c_ULTIMATE.start_main_~i~7 1)) (.cse11 (+ v_v_641_2 5)) (.cse9 (+ v_b_50_2 v_b_49_2)) (.cse14 (* 2 v_b_49_2)) (.cse16 (* 2 v_v_641_2))) (and (<= .cse0 c_~n) (<= v_v_641_2 v_b_49_2) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_49_2) 4) (or (= v_v_641_2 (select c_~array v_idx_62)) (< v_idx_62 v_b_49_2) (<= v_b_50_2 v_idx_62)) (or (<= v_b_49_2 v_idx_61) (= v_v_640_2 (select c_~array v_idx_61))) (<= .cse1 0) (<= .cse2 5) (<= .cse3 10) (<= .cse4 10) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_641_2) 4) (<= .cse5 9) (<= c_~n .cse6) (<= .cse7 8) (<= v_b_50_2 .cse6) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_49_2 1)) (<= .cse8 5) (<= 10 .cse3) (<= 0 .cse1) (<= 0 (+ .cse7 2)) (<= 5 .cse9) (<= v_b_50_2 c_~n) (<= v_b_49_2 v_v_641_2) (<= .cse10 9) (<= v_b_49_2 .cse0) (<= c_~n .cse11) (<= 5 .cse8) (<= c_~n .cse12) (<= 10 .cse4) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_641_2 4)) (<= 5 .cse13) (<= .cse6 v_b_50_2) (<= .cse6 c_~n) (<= .cse13 5) (<= v_b_50_2 .cse12) (<= 4 .cse10) (<= v_b_50_2 .cse11) (<= 0 .cse14) (<= 4 .cse5) (<= .cse0 v_b_50_2) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_641_2 1)) (<= .cse15 10) (<= 5 .cse2) (<= .cse16 0) (<= .cse11 c_~n) (or (< v_idx_63 v_b_50_2) (= v_v_642_2 (select c_~array v_idx_63))) (<= 10 .cse15) (<= v_v_641_2 .cse0) (<= c_~n v_b_50_2) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_49_2 4)) (<= .cse11 v_b_50_2) (<= .cse9 5) (<= .cse14 0) (<= 0 .cse16))))) (forall ((v_idx_65 Int) (v_idx_66 Int) (v_idx_64 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse20 (* 2 c_~n)) (.cse18 (+ v_b_49_2 v_v_641_2)) (.cse24 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse25 (+ v_v_641_2 c_~n)) (.cse21 (* 2 v_b_50_2)) (.cse23 (+ v_b_49_2 5)) (.cse30 (+ v_b_49_2 c_~n)) (.cse29 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse27 (+ v_b_50_2 c_ULTIMATE.start_main_~i~7)) (.cse22 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse19 (+ v_b_50_2 v_v_641_2)) (.cse32 (+ v_b_50_2 c_~n)) (.cse17 (+ c_ULTIMATE.start_main_~i~7 1)) (.cse28 (+ v_v_641_2 5)) (.cse26 (+ v_b_50_2 v_b_49_2)) (.cse31 (* 2 v_b_49_2)) (.cse33 (* 2 v_v_641_2))) (and (<= .cse17 c_~n) (<= v_v_641_2 v_b_49_2) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_49_2) 4) (<= .cse18 0) (<= .cse19 5) (<= .cse20 10) (<= .cse21 10) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_641_2) 4) (<= .cse22 9) (<= c_~n .cse23) (<= .cse24 8) (or (<= v_b_50_2 v_idx_65) (< v_idx_65 v_b_49_2) (= v_v_641_2 (select c_~array v_idx_65))) (<= v_b_50_2 .cse23) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_49_2 1)) (<= .cse25 5) (<= 10 .cse20) (<= 0 .cse18) (<= 0 (+ .cse24 2)) (<= 5 .cse26) (<= v_b_50_2 c_~n) (<= v_b_49_2 v_v_641_2) (<= .cse27 9) (<= v_b_49_2 .cse17) (<= c_~n .cse28) (<= 5 .cse25) (<= c_~n .cse29) (<= 10 .cse21) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_641_2 4)) (or (= v_v_640_2 (select c_~array v_idx_64)) (<= v_b_49_2 v_idx_64)) (<= 5 .cse30) (<= .cse23 v_b_50_2) (<= .cse23 c_~n) (<= .cse30 5) (<= v_b_50_2 .cse29) (<= 4 .cse27) (<= v_b_50_2 .cse28) (<= 0 .cse31) (<= 4 .cse22) (<= .cse17 v_b_50_2) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_641_2 1)) (<= .cse32 10) (or (< v_idx_66 v_b_50_2) (= v_v_642_2 (select c_~array v_idx_66))) (<= 5 .cse19) (<= .cse33 0) (<= .cse28 c_~n) (<= 10 .cse32) (<= v_v_641_2 .cse17) (<= c_~n v_b_50_2) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_49_2 4)) (<= .cse28 v_b_50_2) (<= .cse26 5) (<= .cse31 0) (<= 0 .cse33)))))) is different from false [2018-12-24 14:14:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:04,437 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-12-24 14:14:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:14:04,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 14:14:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:04,438 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:14:04,439 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 14:14:04,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13, Invalid=8, Unknown=5, NotChecked=30, Total=56 [2018-12-24 14:14:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 14:14:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 14:14:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 14:14:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-24 14:14:04,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-12-24 14:14:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:04,447 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-24 14:14:04,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 14:14:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-24 14:14:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:14:04,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:04,448 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:04,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 315564274, now seen corresponding path program 2 times [2018-12-24 14:14:04,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:04,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:04,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:04,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:04,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:04,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:04,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:04,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:04,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:04,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:04,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:04,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:14:04,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:04,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:04,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:04,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:04,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-24 14:14:04,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:04,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:14:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:14:04,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:04,943 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-12-24 14:14:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:05,020 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-24 14:14:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:14:05,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-24 14:14:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:05,022 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:14:05,022 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 14:14:05,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 14:14:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-24 14:14:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 14:14:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-24 14:14:05,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-12-24 14:14:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:05,030 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-24 14:14:05,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:14:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-24 14:14:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:14:05,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:05,031 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:05,031 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1241275689, now seen corresponding path program 3 times [2018-12-24 14:14:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:05,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:05,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:05,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:05,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:05,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:05,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:05,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:05,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:05,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-24 14:14:05,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:05,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:14:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:14:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:05,317 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2018-12-24 14:14:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:05,358 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-12-24 14:14:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:14:05,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-12-24 14:14:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:05,359 INFO L225 Difference]: With dead ends: 16 [2018-12-24 14:14:05,359 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:14:05,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:14:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 14:14:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:14:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-24 14:14:05,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-12-24 14:14:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:05,366 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-24 14:14:05,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:14:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-24 14:14:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:14:05,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:05,367 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:05,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash -126441518, now seen corresponding path program 4 times [2018-12-24 14:14:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:05,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:05,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:05,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:05,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:05,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-24 14:14:05,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:05,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 14:14:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 14:14:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:05,600 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 7 states. [2018-12-24 14:14:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:05,631 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-24 14:14:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:14:05,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-12-24 14:14:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:05,634 INFO L225 Difference]: With dead ends: 17 [2018-12-24 14:14:05,634 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 14:14:05,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-24 14:14:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 14:14:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 14:14:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 14:14:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-24 14:14:05,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-24 14:14:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:05,642 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-24 14:14:05,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 14:14:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-24 14:14:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-24 14:14:05,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:05,642 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:05,643 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash 423998025, now seen corresponding path program 5 times [2018-12-24 14:14:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:14:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:14:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-24 14:14:05,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:14:05,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:14:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:14:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-24 14:14:05,721 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-24 14:14:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:05,824 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-24 14:14:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:14:05,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-24 14:14:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:05,828 INFO L225 Difference]: With dead ends: 18 [2018-12-24 14:14:05,828 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:14:05,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:14:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:14:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 14:14:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:14:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-24 14:14:05,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-12-24 14:14:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:05,839 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-24 14:14:05,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:14:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-24 14:14:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 14:14:05,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:05,842 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:05,843 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 1 times [2018-12-24 14:14:05,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:05,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:05,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:14:06,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:06,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:06,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-24 14:14:06,151 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2018-12-24 14:14:06,156 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:14:06,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:14:09,008 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-24 14:14:09,009 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:14:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:09,009 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-24 14:14:09,223 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 27.08% of their original sizes. [2018-12-24 14:14:09,223 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-24 14:14:11,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_162 Int) (v_idx_160 Int) (v_idx_161 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (<= .cse1 c_~n) (or (= v_v_693_3 (select c_~array v_idx_161)) (< v_idx_161 v_b_48_3) (<= v_b_49_3 v_idx_161)) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (or (= v_v_694_3 (select c_~array v_idx_162)) (< v_idx_162 v_b_49_3)) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (or (= v_v_692_3 (select c_~array v_idx_160)) (<= v_b_48_3 v_idx_160)) (<= .cse1 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:13,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_163 Int) (v_idx_164 Int) (v_idx_165 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (or (= v_v_692_3 (select c_~array v_idx_163)) (<= v_b_48_3 v_idx_163)) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (or (= v_v_693_3 (select c_~array v_idx_164)) (< v_idx_164 v_b_48_3) (<= v_b_49_3 v_idx_164)) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_165 v_b_49_3) (= v_v_694_3 (select c_~array v_idx_165))) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:15,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_168 Int) (v_idx_166 Int) (v_idx_167 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_167) (< v_idx_167 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_167))) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (or (= v_v_694_3 (select c_~array v_idx_168)) (< v_idx_168 v_b_49_3)) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (or (<= v_b_48_3 v_idx_166) (= v_v_692_3 (select c_~array v_idx_166))) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:17,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_170))) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select c_~array v_idx_169))) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select c_~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:19,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:21,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) is different from false [2018-12-24 14:14:23,802 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_179 Int) (v_idx_180 Int) (v_idx_178 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse3 (* 2 c_~n)) (.cse6 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse7 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (.cse10 (+ v_b_49_3 c_~n)) (.cse4 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3)) (.cse9 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_3)) (.cse13 (+ v_v_693_3 v_b_48_3)) (.cse11 (+ v_v_693_3 c_~n)) (.cse15 (* 2 v_v_693_3)) (.cse12 (+ v_v_693_3 v_b_49_3)) (.cse14 (+ v_b_48_3 v_b_49_3)) (.cse16 (* 2 v_b_49_3)) (.cse8 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse5 (* 2 v_b_48_3)) (.cse2 (* 2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse1 (+ c_ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse17 (+ v_b_48_3 c_~n))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (<= c_~n .cse1) (<= .cse2 0) (<= .cse3 10) (<= .cse4 0) (<= .cse5 0) (<= 0 .cse6) (<= 5 .cse7) (<= 10 .cse3) (<= .cse6 0) (<= .cse8 c_~n) (<= v_b_49_3 .cse1) (<= .cse0 v_b_49_3) (<= 5 .cse9) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (or (= (select c_~array v_idx_179) v_v_693_3) (< v_idx_179 v_b_48_3) (<= v_b_49_3 v_idx_179)) (<= .cse7 5) (<= v_v_693_3 v_b_48_3) (<= 10 .cse10) (<= .cse10 10) (<= v_b_49_3 .cse0) (<= 0 .cse4) (<= v_b_48_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse9 5) (<= 5 .cse11) (<= .cse12 5) (<= .cse13 0) (<= .cse8 v_b_49_3) (<= .cse1 c_~n) (<= 0 .cse13) (<= .cse11 5) (<= 5 .cse14) (<= c_~n .cse8) (<= .cse15 0) (<= 0 .cse15) (<= 5 .cse12) (<= 10 .cse16) (<= v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse14 5) (<= .cse16 10) (<= v_b_49_3 .cse8) (<= c_~n .cse0) (<= 0 .cse5) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_v_693_3) (<= 5 .cse17) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3) (<= 0 .cse2) (<= .cse1 v_b_49_3) (or (<= v_b_48_3 v_idx_178) (= v_v_692_3 (select c_~array v_idx_178))) (or (< v_idx_180 v_b_49_3) (= (select c_~array v_idx_180) v_v_694_3)) (<= .cse17 5))))) is different from false [2018-12-24 14:14:25,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_181 Int) (v_idx_182 Int) (v_idx_183 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse0 (+ v_b_48_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse10 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse20 (+ v_v_693_3 v_b_48_3)) (.cse6 (+ v_b_48_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse12 (+ v_v_693_3 5)) (.cse11 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse9 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (.cse25 (+ v_b_48_3 c_~n)) (.cse17 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3)) (.cse1 (+ v_b_49_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse15 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (.cse28 (* 2 c_~n)) (.cse14 (+ c_ULTIMATE.start_SelectionSort_~i~4 4)) (.cse5 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse8 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse22 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse16 (+ v_b_49_3 c_~n)) (.cse30 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_3)) (.cse21 (+ v_b_48_3 1)) (.cse18 (+ c_ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse26 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse19 (+ v_v_693_3 c_~n)) (.cse23 (* 2 v_v_693_3)) (.cse7 (+ c_ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse32 (+ v_v_693_3 v_b_49_3)) (.cse3 (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse24 (+ v_b_49_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse35 (+ v_b_48_3 v_b_49_3)) (.cse27 (* 2 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse36 (* 2 v_b_49_3)) (.cse13 (+ v_b_48_3 5)) (.cse29 (* 2 v_b_48_3)) (.cse31 (* 2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse4 (* 2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse33 (+ v_v_693_3 1)) (.cse2 (+ c_ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse34 (+ c_ULTIMATE.start_SelectionSort_~rh~4 c_~n))) (and (<= .cse0 0) (<= 5 .cse1) (or (= (select c_~array v_idx_183) v_v_694_3) (< v_idx_183 v_b_49_3)) (<= c_~n .cse2) (<= 0 .cse0) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse3) (<= .cse4 0) (<= 0 .cse5) (<= .cse6 1) (<= v_b_49_3 .cse7) (<= 0 .cse8) (<= .cse9 6) (<= .cse10 1) (<= .cse11 1) (<= .cse12 c_~n) (<= v_b_49_3 .cse2) (<= .cse13 v_b_49_3) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= 1 .cse10) (<= c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~lh~4) (<= v_b_49_3 .cse14) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_v_693_3) (<= .cse15 5) (<= .cse14 v_b_49_3) (<= v_v_693_3 v_b_48_3) (<= 10 .cse16) (<= 0 .cse17) (<= .cse18 c_ULTIMATE.start_SelectionSort_~i~4) (<= v_b_48_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= 5 .cse19) (<= .cse7 c_~n) (<= .cse20 0) (<= .cse12 v_b_49_3) (<= .cse21 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse22 1) (<= 0 .cse20) (<= c_~n .cse12) (<= .cse23 0) (<= v_v_693_3 c_ULTIMATE.start_SelectionSort_~rh~4) (<= 1 .cse6) (<= c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_49_3 .cse12) (<= 1 .cse11) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_v_693_3) (<= 6 .cse24) (<= 5 .cse25) (<= .cse26 0) (<= 6 .cse9) (<= 2 .cse27) (<= .cse25 5) (or (<= v_b_49_3 v_idx_182) (= v_v_693_3 (select c_~array v_idx_182)) (< v_idx_182 v_b_48_3)) (<= v_b_48_3 v_v_693_3) (<= .cse13 c_~n) (<= .cse7 v_b_49_3) (<= .cse28 10) (<= .cse17 0) (<= .cse1 5) (<= .cse29 0) (<= c_~n .cse14) (<= 5 .cse15) (<= 10 .cse28) (<= .cse14 c_~n) (<= .cse5 0) (<= .cse8 0) (<= 5 .cse30) (<= 1 .cse22) (<= .cse16 10) (<= v_b_49_3 .cse13) (<= .cse31 0) (<= .cse30 5) (<= .cse32 5) (<= .cse2 c_~n) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse21) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse18) (<= .cse33 c_ULTIMATE.start_SelectionSort_~i~4) (<= 5 .cse34) (<= 0 .cse26) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_b_48_3) (<= .cse19 5) (<= 5 .cse35) (<= 0 .cse23) (<= c_~n .cse7) (<= 5 .cse32) (<= 10 .cse36) (<= v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse3 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse24 6) (<= .cse35 5) (<= .cse27 2) (<= v_b_48_3 c_ULTIMATE.start_SelectionSort_~rh~4) (<= .cse36 10) (<= c_~n .cse13) (<= 0 .cse29) (<= 0 .cse31) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3) (or (<= v_b_48_3 v_idx_181) (= v_v_692_3 (select c_~array v_idx_181))) (<= 0 .cse4) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse33) (<= .cse2 v_b_49_3) (<= .cse34 5))))) is different from false [2018-12-24 14:14:27,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_184 Int) (v_idx_185 Int) (v_idx_186 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse0 (+ v_b_48_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse10 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse20 (+ v_v_693_3 v_b_48_3)) (.cse6 (+ v_b_48_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse12 (+ v_v_693_3 5)) (.cse11 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse9 (+ c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (.cse25 (+ v_b_48_3 c_~n)) (.cse17 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3)) (.cse1 (+ v_b_49_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse15 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (.cse28 (* 2 c_~n)) (.cse14 (+ c_ULTIMATE.start_SelectionSort_~i~4 4)) (.cse5 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse8 (+ c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse22 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse16 (+ v_b_49_3 c_~n)) (.cse30 (+ c_ULTIMATE.start_SelectionSort_~lh~4 v_b_49_3)) (.cse21 (+ v_b_48_3 1)) (.cse18 (+ c_ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse26 (+ v_v_693_3 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse19 (+ v_v_693_3 c_~n)) (.cse23 (* 2 v_v_693_3)) (.cse7 (+ c_ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse32 (+ v_v_693_3 v_b_49_3)) (.cse3 (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse24 (+ v_b_49_3 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse35 (+ v_b_48_3 v_b_49_3)) (.cse27 (* 2 c_ULTIMATE.start_SelectionSort_~i~4)) (.cse36 (* 2 v_b_49_3)) (.cse13 (+ v_b_48_3 5)) (.cse29 (* 2 v_b_48_3)) (.cse31 (* 2 c_ULTIMATE.start_SelectionSort_~rh~4)) (.cse4 (* 2 c_ULTIMATE.start_SelectionSort_~lh~4)) (.cse33 (+ v_v_693_3 1)) (.cse2 (+ c_ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse34 (+ c_ULTIMATE.start_SelectionSort_~rh~4 c_~n))) (and (<= .cse0 0) (<= 5 .cse1) (<= c_~n .cse2) (<= 0 .cse0) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse3) (<= .cse4 0) (or (= (select c_~array v_idx_186) v_v_694_3) (< v_idx_186 v_b_49_3)) (<= 0 .cse5) (<= .cse6 1) (<= v_b_49_3 .cse7) (<= 0 .cse8) (<= .cse9 6) (<= .cse10 1) (<= .cse11 1) (<= .cse12 c_~n) (<= v_b_49_3 .cse2) (<= .cse13 v_b_49_3) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= 1 .cse10) (<= c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~lh~4) (<= v_b_49_3 .cse14) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_v_693_3) (<= .cse15 5) (<= .cse14 v_b_49_3) (<= v_v_693_3 v_b_48_3) (<= 10 .cse16) (<= 0 .cse17) (<= .cse18 c_ULTIMATE.start_SelectionSort_~i~4) (<= v_b_48_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= 5 .cse19) (<= .cse7 c_~n) (<= .cse20 0) (<= .cse12 v_b_49_3) (<= .cse21 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse22 1) (<= 0 .cse20) (<= c_~n .cse12) (<= .cse23 0) (<= v_v_693_3 c_ULTIMATE.start_SelectionSort_~rh~4) (<= 1 .cse6) (<= c_ULTIMATE.start_SelectionSort_~lh~4 c_ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_49_3 .cse12) (<= 1 .cse11) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_v_693_3) (<= 6 .cse24) (<= 5 .cse25) (<= .cse26 0) (or (= v_v_692_3 (select c_~array v_idx_184)) (<= v_b_48_3 v_idx_184)) (<= 6 .cse9) (<= 2 .cse27) (<= .cse25 5) (<= v_b_48_3 v_v_693_3) (<= .cse13 c_~n) (<= .cse7 v_b_49_3) (<= .cse28 10) (<= .cse17 0) (<= .cse1 5) (<= .cse29 0) (<= c_~n .cse14) (<= 5 .cse15) (<= 10 .cse28) (<= .cse14 c_~n) (<= .cse5 0) (<= .cse8 0) (<= 5 .cse30) (<= 1 .cse22) (<= .cse16 10) (<= v_b_49_3 .cse13) (<= .cse31 0) (<= .cse30 5) (<= .cse32 5) (or (= v_v_693_3 (select c_~array v_idx_185)) (<= v_b_49_3 v_idx_185) (< v_idx_185 v_b_48_3)) (<= .cse2 c_~n) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse21) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse18) (<= .cse33 c_ULTIMATE.start_SelectionSort_~i~4) (<= 5 .cse34) (<= 0 .cse26) (<= c_ULTIMATE.start_SelectionSort_~rh~4 v_b_48_3) (<= .cse19 5) (<= 5 .cse35) (<= 0 .cse23) (<= c_~n .cse7) (<= 5 .cse32) (<= 10 .cse36) (<= v_v_693_3 c_ULTIMATE.start_SelectionSort_~lh~4) (<= .cse3 c_ULTIMATE.start_SelectionSort_~i~4) (<= .cse24 6) (<= .cse35 5) (<= .cse27 2) (<= v_b_48_3 c_ULTIMATE.start_SelectionSort_~rh~4) (<= .cse36 10) (<= c_~n .cse13) (<= 0 .cse29) (<= 0 .cse31) (<= c_ULTIMATE.start_SelectionSort_~lh~4 v_b_48_3) (<= 0 .cse4) (<= c_ULTIMATE.start_SelectionSort_~i~4 .cse33) (<= .cse2 v_b_49_3) (<= .cse34 5))))) is different from false [2018-12-24 14:14:28,028 INFO L420 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2018-12-24 14:14:28,029 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-24 14:14:28,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:14:28,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-12-24 14:14:28,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:14:28,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:14:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:14:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=12, Unknown=9, NotChecked=90, Total=132 [2018-12-24 14:14:28,033 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2018-12-24 14:14:30,438 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse19 (* 2 c_~n)) (.cse22 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse23 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse25 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse26 (+ v_b_49_3 c_~n)) (.cse20 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse29 (+ v_v_693_3 v_b_48_3)) (.cse27 (+ v_v_693_3 c_~n)) (.cse31 (* 2 v_v_693_3)) (.cse28 (+ v_v_693_3 v_b_49_3)) (.cse30 (+ v_b_48_3 v_b_49_3)) (.cse32 (* 2 v_b_49_3)) (.cse24 (+ v_v_693_3 5)) (.cse17 (+ v_b_48_3 5)) (.cse21 (* 2 v_b_48_3)) (.cse33 (+ v_b_48_3 c_~n)) (.cse18 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse17 c_~n) (<= .cse18 c_~n) (<= .cse19 10) (<= .cse20 9) (<= .cse21 0) (<= .cse22 8) (<= v_b_49_3 .cse23) (<= 10 .cse19) (<= .cse24 c_~n) (<= 0 (+ .cse22 2)) (<= .cse25 9) (<= .cse17 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse23) (<= 4 .cse25) (<= v_v_693_3 v_b_48_3) (<= 10 .cse26) (<= .cse26 10) (<= v_b_49_3 .cse17) (<= 5 .cse27) (<= .cse28 5) (<= .cse29 0) (<= .cse24 v_b_49_3) (<= 4 .cse20) (<= v_v_693_3 .cse18) (<= 0 .cse29) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse27 5) (<= 5 .cse30) (<= c_~n .cse24) (<= .cse31 0) (<= 0 .cse31) (<= 5 .cse28) (<= 10 .cse32) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse30 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse32 10) (<= v_b_49_3 .cse24) (<= c_~n .cse17) (<= 0 .cse21) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse33) (<= .cse18 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse33 5) (<= v_b_48_3 .cse18))))) (forall ((v_idx_162 Int) (v_idx_160 Int) (v_idx_161 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse36 (* 2 c_~n)) (.cse39 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse40 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse42 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse43 (+ v_b_49_3 c_~n)) (.cse37 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse46 (+ v_v_693_3 v_b_48_3)) (.cse44 (+ v_v_693_3 c_~n)) (.cse48 (* 2 v_v_693_3)) (.cse45 (+ v_v_693_3 v_b_49_3)) (.cse47 (+ v_b_48_3 v_b_49_3)) (.cse49 (* 2 v_b_49_3)) (.cse41 (+ v_v_693_3 5)) (.cse34 (+ v_b_48_3 5)) (.cse38 (* 2 v_b_48_3)) (.cse50 (+ v_b_48_3 c_~n)) (.cse35 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse34 c_~n) (<= .cse35 c_~n) (or (= v_v_693_3 (select c_~array v_idx_161)) (< v_idx_161 v_b_48_3) (<= v_b_49_3 v_idx_161)) (<= .cse36 10) (<= .cse37 9) (<= .cse38 0) (<= .cse39 8) (<= v_b_49_3 .cse40) (<= 10 .cse36) (<= .cse41 c_~n) (<= 0 (+ .cse39 2)) (<= .cse42 9) (<= .cse34 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse40) (<= 4 .cse42) (<= v_v_693_3 v_b_48_3) (<= 10 .cse43) (<= .cse43 10) (<= v_b_49_3 .cse34) (<= 5 .cse44) (<= .cse45 5) (<= .cse46 0) (<= .cse41 v_b_49_3) (<= 4 .cse37) (<= v_v_693_3 .cse35) (<= 0 .cse46) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse44 5) (<= 5 .cse47) (or (= v_v_694_3 (select c_~array v_idx_162)) (< v_idx_162 v_b_49_3)) (<= c_~n .cse41) (<= .cse48 0) (<= 0 .cse48) (<= 5 .cse45) (<= 10 .cse49) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse47 5) (<= .cse49 10) (<= v_b_49_3 .cse41) (<= c_~n .cse34) (<= 0 .cse38) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse50) (or (= v_v_692_3 (select c_~array v_idx_160)) (<= v_b_48_3 v_idx_160)) (<= .cse35 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse50 5) (<= v_b_48_3 .cse35))))) (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse53 (* 2 c_~n)) (.cse56 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse57 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse59 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse60 (+ v_b_49_3 c_~n)) (.cse54 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse63 (+ v_v_693_3 v_b_48_3)) (.cse61 (+ v_v_693_3 c_~n)) (.cse65 (* 2 v_v_693_3)) (.cse62 (+ v_v_693_3 v_b_49_3)) (.cse64 (+ v_b_48_3 v_b_49_3)) (.cse66 (* 2 v_b_49_3)) (.cse58 (+ v_v_693_3 5)) (.cse51 (+ v_b_48_3 5)) (.cse55 (* 2 v_b_48_3)) (.cse67 (+ v_b_48_3 c_~n)) (.cse52 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse51 c_~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_170))) (<= .cse52 c_~n) (<= .cse53 10) (<= .cse54 9) (<= .cse55 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select c_~array v_idx_169))) (<= .cse56 8) (<= v_b_49_3 .cse57) (<= 10 .cse53) (<= .cse58 c_~n) (<= 0 (+ .cse56 2)) (<= .cse59 9) (<= .cse51 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse57) (<= 4 .cse59) (<= v_v_693_3 v_b_48_3) (<= 10 .cse60) (<= .cse60 10) (<= v_b_49_3 .cse51) (<= 5 .cse61) (<= .cse62 5) (<= .cse63 0) (<= .cse58 v_b_49_3) (<= 4 .cse54) (<= v_v_693_3 .cse52) (<= 0 .cse63) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse61 5) (<= 5 .cse64) (<= c_~n .cse58) (<= .cse65 0) (<= 0 .cse65) (<= 5 .cse62) (<= 10 .cse66) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse64 5) (<= .cse66 10) (<= v_b_49_3 .cse58) (<= c_~n .cse51) (<= 0 .cse55) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select c_~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse67) (<= .cse52 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse67 5) (<= v_b_48_3 .cse52))))) (forall ((v_idx_168 Int) (v_idx_166 Int) (v_idx_167 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse70 (* 2 c_~n)) (.cse73 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse74 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse76 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse77 (+ v_b_49_3 c_~n)) (.cse71 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse80 (+ v_v_693_3 v_b_48_3)) (.cse78 (+ v_v_693_3 c_~n)) (.cse82 (* 2 v_v_693_3)) (.cse79 (+ v_v_693_3 v_b_49_3)) (.cse81 (+ v_b_48_3 v_b_49_3)) (.cse83 (* 2 v_b_49_3)) (.cse75 (+ v_v_693_3 5)) (.cse68 (+ v_b_48_3 5)) (.cse72 (* 2 v_b_48_3)) (.cse84 (+ v_b_48_3 c_~n)) (.cse69 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse68 c_~n) (or (<= v_b_49_3 v_idx_167) (< v_idx_167 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_167))) (<= .cse69 c_~n) (<= .cse70 10) (<= .cse71 9) (<= .cse72 0) (<= .cse73 8) (<= v_b_49_3 .cse74) (<= 10 .cse70) (<= .cse75 c_~n) (<= 0 (+ .cse73 2)) (<= .cse76 9) (or (= v_v_694_3 (select c_~array v_idx_168)) (< v_idx_168 v_b_49_3)) (<= .cse68 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse74) (<= 4 .cse76) (<= v_v_693_3 v_b_48_3) (or (<= v_b_48_3 v_idx_166) (= v_v_692_3 (select c_~array v_idx_166))) (<= 10 .cse77) (<= .cse77 10) (<= v_b_49_3 .cse68) (<= 5 .cse78) (<= .cse79 5) (<= .cse80 0) (<= .cse75 v_b_49_3) (<= 4 .cse71) (<= v_v_693_3 .cse69) (<= 0 .cse80) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse78 5) (<= 5 .cse81) (<= c_~n .cse75) (<= .cse82 0) (<= 0 .cse82) (<= 5 .cse79) (<= 10 .cse83) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse81 5) (<= .cse83 10) (<= v_b_49_3 .cse75) (<= c_~n .cse68) (<= 0 .cse72) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse84) (<= .cse69 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse84 5) (<= v_b_48_3 .cse69))))) (forall ((v_idx_163 Int) (v_idx_164 Int) (v_idx_165 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse87 (* 2 c_~n)) (.cse90 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse91 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse93 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse94 (+ v_b_49_3 c_~n)) (.cse88 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse97 (+ v_v_693_3 v_b_48_3)) (.cse95 (+ v_v_693_3 c_~n)) (.cse99 (* 2 v_v_693_3)) (.cse96 (+ v_v_693_3 v_b_49_3)) (.cse98 (+ v_b_48_3 v_b_49_3)) (.cse100 (* 2 v_b_49_3)) (.cse92 (+ v_v_693_3 5)) (.cse85 (+ v_b_48_3 5)) (.cse89 (* 2 v_b_48_3)) (.cse101 (+ v_b_48_3 c_~n)) (.cse86 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse85 c_~n) (<= .cse86 c_~n) (<= .cse87 10) (<= .cse88 9) (<= .cse89 0) (<= .cse90 8) (<= v_b_49_3 .cse91) (<= 10 .cse87) (<= .cse92 c_~n) (<= 0 (+ .cse90 2)) (<= .cse93 9) (<= .cse85 v_b_49_3) (or (= v_v_692_3 (select c_~array v_idx_163)) (<= v_b_48_3 v_idx_163)) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse91) (<= 4 .cse93) (<= v_v_693_3 v_b_48_3) (or (= v_v_693_3 (select c_~array v_idx_164)) (< v_idx_164 v_b_48_3) (<= v_b_49_3 v_idx_164)) (<= 10 .cse94) (<= .cse94 10) (<= v_b_49_3 .cse85) (<= 5 .cse95) (<= .cse96 5) (<= .cse97 0) (<= .cse92 v_b_49_3) (<= 4 .cse88) (<= v_v_693_3 .cse86) (<= 0 .cse97) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_165 v_b_49_3) (= v_v_694_3 (select c_~array v_idx_165))) (<= .cse95 5) (<= 5 .cse98) (<= c_~n .cse92) (<= .cse99 0) (<= 0 .cse99) (<= 5 .cse96) (<= 10 .cse100) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse98 5) (<= .cse100 10) (<= v_b_49_3 .cse92) (<= c_~n .cse85) (<= 0 .cse89) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse101) (<= .cse86 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse101 5) (<= v_b_48_3 .cse86)))))) is different from false [2018-12-24 14:14:35,134 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse19 (* 2 c_~n)) (.cse22 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse23 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse25 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse26 (+ v_b_49_3 c_~n)) (.cse20 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse29 (+ v_v_693_3 v_b_48_3)) (.cse27 (+ v_v_693_3 c_~n)) (.cse31 (* 2 v_v_693_3)) (.cse28 (+ v_v_693_3 v_b_49_3)) (.cse30 (+ v_b_48_3 v_b_49_3)) (.cse32 (* 2 v_b_49_3)) (.cse24 (+ v_v_693_3 5)) (.cse17 (+ v_b_48_3 5)) (.cse21 (* 2 v_b_48_3)) (.cse33 (+ v_b_48_3 c_~n)) (.cse18 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse17 c_~n) (<= .cse18 c_~n) (<= .cse19 10) (<= .cse20 9) (<= .cse21 0) (<= .cse22 8) (<= v_b_49_3 .cse23) (<= 10 .cse19) (<= .cse24 c_~n) (<= 0 (+ .cse22 2)) (<= .cse25 9) (<= .cse17 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse23) (<= 4 .cse25) (<= v_v_693_3 v_b_48_3) (<= 10 .cse26) (<= .cse26 10) (<= v_b_49_3 .cse17) (<= 5 .cse27) (<= .cse28 5) (<= .cse29 0) (<= .cse24 v_b_49_3) (<= 4 .cse20) (<= v_v_693_3 .cse18) (<= 0 .cse29) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse27 5) (<= 5 .cse30) (<= c_~n .cse24) (<= .cse31 0) (<= 0 .cse31) (<= 5 .cse28) (<= 10 .cse32) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse30 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse32 10) (<= v_b_49_3 .cse24) (<= c_~n .cse17) (<= 0 .cse21) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse33) (<= .cse18 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse33 5) (<= v_b_48_3 .cse18))))) (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse36 (* 2 c_~n)) (.cse39 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse40 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse42 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse43 (+ v_b_49_3 c_~n)) (.cse37 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse46 (+ v_v_693_3 v_b_48_3)) (.cse44 (+ v_v_693_3 c_~n)) (.cse48 (* 2 v_v_693_3)) (.cse45 (+ v_v_693_3 v_b_49_3)) (.cse47 (+ v_b_48_3 v_b_49_3)) (.cse49 (* 2 v_b_49_3)) (.cse41 (+ v_v_693_3 5)) (.cse34 (+ v_b_48_3 5)) (.cse38 (* 2 v_b_48_3)) (.cse50 (+ v_b_48_3 c_~n)) (.cse35 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse34 c_~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_170))) (<= .cse35 c_~n) (<= .cse36 10) (<= .cse37 9) (<= .cse38 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select c_~array v_idx_169))) (<= .cse39 8) (<= v_b_49_3 .cse40) (<= 10 .cse36) (<= .cse41 c_~n) (<= 0 (+ .cse39 2)) (<= .cse42 9) (<= .cse34 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse40) (<= 4 .cse42) (<= v_v_693_3 v_b_48_3) (<= 10 .cse43) (<= .cse43 10) (<= v_b_49_3 .cse34) (<= 5 .cse44) (<= .cse45 5) (<= .cse46 0) (<= .cse41 v_b_49_3) (<= 4 .cse37) (<= v_v_693_3 .cse35) (<= 0 .cse46) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse44 5) (<= 5 .cse47) (<= c_~n .cse41) (<= .cse48 0) (<= 0 .cse48) (<= 5 .cse45) (<= 10 .cse49) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse47 5) (<= .cse49 10) (<= v_b_49_3 .cse41) (<= c_~n .cse34) (<= 0 .cse38) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select c_~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse50) (<= .cse35 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse50 5) (<= v_b_48_3 .cse35))))) (forall ((v_idx_168 Int) (v_idx_166 Int) (v_idx_167 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse53 (* 2 c_~n)) (.cse56 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse57 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse59 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse60 (+ v_b_49_3 c_~n)) (.cse54 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse63 (+ v_v_693_3 v_b_48_3)) (.cse61 (+ v_v_693_3 c_~n)) (.cse65 (* 2 v_v_693_3)) (.cse62 (+ v_v_693_3 v_b_49_3)) (.cse64 (+ v_b_48_3 v_b_49_3)) (.cse66 (* 2 v_b_49_3)) (.cse58 (+ v_v_693_3 5)) (.cse51 (+ v_b_48_3 5)) (.cse55 (* 2 v_b_48_3)) (.cse67 (+ v_b_48_3 c_~n)) (.cse52 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse51 c_~n) (or (<= v_b_49_3 v_idx_167) (< v_idx_167 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_167))) (<= .cse52 c_~n) (<= .cse53 10) (<= .cse54 9) (<= .cse55 0) (<= .cse56 8) (<= v_b_49_3 .cse57) (<= 10 .cse53) (<= .cse58 c_~n) (<= 0 (+ .cse56 2)) (<= .cse59 9) (or (= v_v_694_3 (select c_~array v_idx_168)) (< v_idx_168 v_b_49_3)) (<= .cse51 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse57) (<= 4 .cse59) (<= v_v_693_3 v_b_48_3) (or (<= v_b_48_3 v_idx_166) (= v_v_692_3 (select c_~array v_idx_166))) (<= 10 .cse60) (<= .cse60 10) (<= v_b_49_3 .cse51) (<= 5 .cse61) (<= .cse62 5) (<= .cse63 0) (<= .cse58 v_b_49_3) (<= 4 .cse54) (<= v_v_693_3 .cse52) (<= 0 .cse63) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse61 5) (<= 5 .cse64) (<= c_~n .cse58) (<= .cse65 0) (<= 0 .cse65) (<= 5 .cse62) (<= 10 .cse66) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse64 5) (<= .cse66 10) (<= v_b_49_3 .cse58) (<= c_~n .cse51) (<= 0 .cse55) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse67) (<= .cse52 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse67 5) (<= v_b_48_3 .cse52))))) (forall ((v_idx_163 Int) (v_idx_164 Int) (v_idx_165 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse70 (* 2 c_~n)) (.cse73 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse74 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse76 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse77 (+ v_b_49_3 c_~n)) (.cse71 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse80 (+ v_v_693_3 v_b_48_3)) (.cse78 (+ v_v_693_3 c_~n)) (.cse82 (* 2 v_v_693_3)) (.cse79 (+ v_v_693_3 v_b_49_3)) (.cse81 (+ v_b_48_3 v_b_49_3)) (.cse83 (* 2 v_b_49_3)) (.cse75 (+ v_v_693_3 5)) (.cse68 (+ v_b_48_3 5)) (.cse72 (* 2 v_b_48_3)) (.cse84 (+ v_b_48_3 c_~n)) (.cse69 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse68 c_~n) (<= .cse69 c_~n) (<= .cse70 10) (<= .cse71 9) (<= .cse72 0) (<= .cse73 8) (<= v_b_49_3 .cse74) (<= 10 .cse70) (<= .cse75 c_~n) (<= 0 (+ .cse73 2)) (<= .cse76 9) (<= .cse68 v_b_49_3) (or (= v_v_692_3 (select c_~array v_idx_163)) (<= v_b_48_3 v_idx_163)) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse74) (<= 4 .cse76) (<= v_v_693_3 v_b_48_3) (or (= v_v_693_3 (select c_~array v_idx_164)) (< v_idx_164 v_b_48_3) (<= v_b_49_3 v_idx_164)) (<= 10 .cse77) (<= .cse77 10) (<= v_b_49_3 .cse68) (<= 5 .cse78) (<= .cse79 5) (<= .cse80 0) (<= .cse75 v_b_49_3) (<= 4 .cse71) (<= v_v_693_3 .cse69) (<= 0 .cse80) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_165 v_b_49_3) (= v_v_694_3 (select c_~array v_idx_165))) (<= .cse78 5) (<= 5 .cse81) (<= c_~n .cse75) (<= .cse82 0) (<= 0 .cse82) (<= 5 .cse79) (<= 10 .cse83) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse81 5) (<= .cse83 10) (<= v_b_49_3 .cse75) (<= c_~n .cse68) (<= 0 .cse72) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse84) (<= .cse69 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse84 5) (<= v_b_48_3 .cse69)))))) is different from false [2018-12-24 14:14:39,781 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse19 (* 2 c_~n)) (.cse22 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse23 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse25 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse26 (+ v_b_49_3 c_~n)) (.cse20 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse29 (+ v_v_693_3 v_b_48_3)) (.cse27 (+ v_v_693_3 c_~n)) (.cse31 (* 2 v_v_693_3)) (.cse28 (+ v_v_693_3 v_b_49_3)) (.cse30 (+ v_b_48_3 v_b_49_3)) (.cse32 (* 2 v_b_49_3)) (.cse24 (+ v_v_693_3 5)) (.cse17 (+ v_b_48_3 5)) (.cse21 (* 2 v_b_48_3)) (.cse33 (+ v_b_48_3 c_~n)) (.cse18 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse17 c_~n) (<= .cse18 c_~n) (<= .cse19 10) (<= .cse20 9) (<= .cse21 0) (<= .cse22 8) (<= v_b_49_3 .cse23) (<= 10 .cse19) (<= .cse24 c_~n) (<= 0 (+ .cse22 2)) (<= .cse25 9) (<= .cse17 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse23) (<= 4 .cse25) (<= v_v_693_3 v_b_48_3) (<= 10 .cse26) (<= .cse26 10) (<= v_b_49_3 .cse17) (<= 5 .cse27) (<= .cse28 5) (<= .cse29 0) (<= .cse24 v_b_49_3) (<= 4 .cse20) (<= v_v_693_3 .cse18) (<= 0 .cse29) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse27 5) (<= 5 .cse30) (<= c_~n .cse24) (<= .cse31 0) (<= 0 .cse31) (<= 5 .cse28) (<= 10 .cse32) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse30 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse32 10) (<= v_b_49_3 .cse24) (<= c_~n .cse17) (<= 0 .cse21) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse33) (<= .cse18 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse33 5) (<= v_b_48_3 .cse18))))) (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse36 (* 2 c_~n)) (.cse39 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse40 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse42 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse43 (+ v_b_49_3 c_~n)) (.cse37 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse46 (+ v_v_693_3 v_b_48_3)) (.cse44 (+ v_v_693_3 c_~n)) (.cse48 (* 2 v_v_693_3)) (.cse45 (+ v_v_693_3 v_b_49_3)) (.cse47 (+ v_b_48_3 v_b_49_3)) (.cse49 (* 2 v_b_49_3)) (.cse41 (+ v_v_693_3 5)) (.cse34 (+ v_b_48_3 5)) (.cse38 (* 2 v_b_48_3)) (.cse50 (+ v_b_48_3 c_~n)) (.cse35 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse34 c_~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_170))) (<= .cse35 c_~n) (<= .cse36 10) (<= .cse37 9) (<= .cse38 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select c_~array v_idx_169))) (<= .cse39 8) (<= v_b_49_3 .cse40) (<= 10 .cse36) (<= .cse41 c_~n) (<= 0 (+ .cse39 2)) (<= .cse42 9) (<= .cse34 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse40) (<= 4 .cse42) (<= v_v_693_3 v_b_48_3) (<= 10 .cse43) (<= .cse43 10) (<= v_b_49_3 .cse34) (<= 5 .cse44) (<= .cse45 5) (<= .cse46 0) (<= .cse41 v_b_49_3) (<= 4 .cse37) (<= v_v_693_3 .cse35) (<= 0 .cse46) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse44 5) (<= 5 .cse47) (<= c_~n .cse41) (<= .cse48 0) (<= 0 .cse48) (<= 5 .cse45) (<= 10 .cse49) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse47 5) (<= .cse49 10) (<= v_b_49_3 .cse41) (<= c_~n .cse34) (<= 0 .cse38) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select c_~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse50) (<= .cse35 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse50 5) (<= v_b_48_3 .cse35))))) (forall ((v_idx_168 Int) (v_idx_166 Int) (v_idx_167 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse53 (* 2 c_~n)) (.cse56 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse57 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse59 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse60 (+ v_b_49_3 c_~n)) (.cse54 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse63 (+ v_v_693_3 v_b_48_3)) (.cse61 (+ v_v_693_3 c_~n)) (.cse65 (* 2 v_v_693_3)) (.cse62 (+ v_v_693_3 v_b_49_3)) (.cse64 (+ v_b_48_3 v_b_49_3)) (.cse66 (* 2 v_b_49_3)) (.cse58 (+ v_v_693_3 5)) (.cse51 (+ v_b_48_3 5)) (.cse55 (* 2 v_b_48_3)) (.cse67 (+ v_b_48_3 c_~n)) (.cse52 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse51 c_~n) (or (<= v_b_49_3 v_idx_167) (< v_idx_167 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_167))) (<= .cse52 c_~n) (<= .cse53 10) (<= .cse54 9) (<= .cse55 0) (<= .cse56 8) (<= v_b_49_3 .cse57) (<= 10 .cse53) (<= .cse58 c_~n) (<= 0 (+ .cse56 2)) (<= .cse59 9) (or (= v_v_694_3 (select c_~array v_idx_168)) (< v_idx_168 v_b_49_3)) (<= .cse51 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse57) (<= 4 .cse59) (<= v_v_693_3 v_b_48_3) (or (<= v_b_48_3 v_idx_166) (= v_v_692_3 (select c_~array v_idx_166))) (<= 10 .cse60) (<= .cse60 10) (<= v_b_49_3 .cse51) (<= 5 .cse61) (<= .cse62 5) (<= .cse63 0) (<= .cse58 v_b_49_3) (<= 4 .cse54) (<= v_v_693_3 .cse52) (<= 0 .cse63) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse61 5) (<= 5 .cse64) (<= c_~n .cse58) (<= .cse65 0) (<= 0 .cse65) (<= 5 .cse62) (<= 10 .cse66) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse64 5) (<= .cse66 10) (<= v_b_49_3 .cse58) (<= c_~n .cse51) (<= 0 .cse55) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse67) (<= .cse52 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse67 5) (<= v_b_48_3 .cse52)))))) is different from false [2018-12-24 14:14:45,907 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse19 (* 2 c_~n)) (.cse22 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse23 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse25 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse26 (+ v_b_49_3 c_~n)) (.cse20 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse29 (+ v_v_693_3 v_b_48_3)) (.cse27 (+ v_v_693_3 c_~n)) (.cse31 (* 2 v_v_693_3)) (.cse28 (+ v_v_693_3 v_b_49_3)) (.cse30 (+ v_b_48_3 v_b_49_3)) (.cse32 (* 2 v_b_49_3)) (.cse24 (+ v_v_693_3 5)) (.cse17 (+ v_b_48_3 5)) (.cse21 (* 2 v_b_48_3)) (.cse33 (+ v_b_48_3 c_~n)) (.cse18 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse17 c_~n) (<= .cse18 c_~n) (<= .cse19 10) (<= .cse20 9) (<= .cse21 0) (<= .cse22 8) (<= v_b_49_3 .cse23) (<= 10 .cse19) (<= .cse24 c_~n) (<= 0 (+ .cse22 2)) (<= .cse25 9) (<= .cse17 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse23) (<= 4 .cse25) (<= v_v_693_3 v_b_48_3) (<= 10 .cse26) (<= .cse26 10) (<= v_b_49_3 .cse17) (<= 5 .cse27) (<= .cse28 5) (<= .cse29 0) (<= .cse24 v_b_49_3) (<= 4 .cse20) (<= v_v_693_3 .cse18) (<= 0 .cse29) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse27 5) (<= 5 .cse30) (<= c_~n .cse24) (<= .cse31 0) (<= 0 .cse31) (<= 5 .cse28) (<= 10 .cse32) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse30 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse32 10) (<= v_b_49_3 .cse24) (<= c_~n .cse17) (<= 0 .cse21) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse33) (<= .cse18 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse33 5) (<= v_b_48_3 .cse18))))) (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse36 (* 2 c_~n)) (.cse39 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse40 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse42 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse43 (+ v_b_49_3 c_~n)) (.cse37 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse46 (+ v_v_693_3 v_b_48_3)) (.cse44 (+ v_v_693_3 c_~n)) (.cse48 (* 2 v_v_693_3)) (.cse45 (+ v_v_693_3 v_b_49_3)) (.cse47 (+ v_b_48_3 v_b_49_3)) (.cse49 (* 2 v_b_49_3)) (.cse41 (+ v_v_693_3 5)) (.cse34 (+ v_b_48_3 5)) (.cse38 (* 2 v_b_48_3)) (.cse50 (+ v_b_48_3 c_~n)) (.cse35 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse34 c_~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select c_~array v_idx_170))) (<= .cse35 c_~n) (<= .cse36 10) (<= .cse37 9) (<= .cse38 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select c_~array v_idx_169))) (<= .cse39 8) (<= v_b_49_3 .cse40) (<= 10 .cse36) (<= .cse41 c_~n) (<= 0 (+ .cse39 2)) (<= .cse42 9) (<= .cse34 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse40) (<= 4 .cse42) (<= v_v_693_3 v_b_48_3) (<= 10 .cse43) (<= .cse43 10) (<= v_b_49_3 .cse34) (<= 5 .cse44) (<= .cse45 5) (<= .cse46 0) (<= .cse41 v_b_49_3) (<= 4 .cse37) (<= v_v_693_3 .cse35) (<= 0 .cse46) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse44 5) (<= 5 .cse47) (<= c_~n .cse41) (<= .cse48 0) (<= 0 .cse48) (<= 5 .cse45) (<= 10 .cse49) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse47 5) (<= .cse49 10) (<= v_b_49_3 .cse41) (<= c_~n .cse34) (<= 0 .cse38) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select c_~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse50) (<= .cse35 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse50 5) (<= v_b_48_3 .cse35)))))) is different from false [2018-12-24 14:14:50,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_173 Int) (v_idx_174 Int) (v_idx_172 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 c_~n)) (.cse5 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse6 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse8 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 c_~n)) (.cse3 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 c_~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 c_~n)) (.cse1 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 c_~n) (or (<= v_b_49_3 v_idx_173) (< v_idx_173 v_b_48_3) (= (select c_~array v_idx_173) v_v_693_3)) (<= .cse1 c_~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (or (= v_v_692_3 (select c_~array v_idx_172)) (<= v_b_48_3 v_idx_172)) (<= .cse7 c_~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= c_~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= c_~n .cse0) (<= 0 .cse4) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (or (< v_idx_174 v_b_49_3) (= (select c_~array v_idx_174) v_v_694_3)) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) (forall ((v_idx_177 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse19 (* 2 c_~n)) (.cse22 (* 2 c_ULTIMATE.start_main_~i~7)) (.cse23 (+ c_ULTIMATE.start_main_~i~7 6)) (.cse25 (+ c_ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse26 (+ v_b_49_3 c_~n)) (.cse20 (+ c_ULTIMATE.start_main_~i~7 c_~n)) (.cse29 (+ v_v_693_3 v_b_48_3)) (.cse27 (+ v_v_693_3 c_~n)) (.cse31 (* 2 v_v_693_3)) (.cse28 (+ v_v_693_3 v_b_49_3)) (.cse30 (+ v_b_48_3 v_b_49_3)) (.cse32 (* 2 v_b_49_3)) (.cse24 (+ v_v_693_3 5)) (.cse17 (+ v_b_48_3 5)) (.cse21 (* 2 v_b_48_3)) (.cse33 (+ v_b_48_3 c_~n)) (.cse18 (+ c_ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse17 c_~n) (<= .cse18 c_~n) (<= .cse19 10) (<= .cse20 9) (<= .cse21 0) (<= .cse22 8) (<= v_b_49_3 .cse23) (<= 10 .cse19) (<= .cse24 c_~n) (<= 0 (+ .cse22 2)) (<= .cse25 9) (<= .cse17 v_b_49_3) (<= (+ c_ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= c_~n v_b_49_3) (<= v_b_49_3 c_~n) (<= c_~n .cse23) (<= 4 .cse25) (<= v_v_693_3 v_b_48_3) (<= 10 .cse26) (<= .cse26 10) (<= v_b_49_3 .cse17) (<= 5 .cse27) (<= .cse28 5) (<= .cse29 0) (<= .cse24 v_b_49_3) (<= 4 .cse20) (<= v_v_693_3 .cse18) (<= 0 .cse29) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= c_ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (or (< v_idx_177 v_b_49_3) (= (select c_~array v_idx_177) v_v_694_3)) (<= .cse27 5) (<= 5 .cse30) (<= c_~n .cse24) (<= .cse31 0) (<= 0 .cse31) (<= 5 .cse28) (<= 10 .cse32) (<= (+ c_ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse30 5) (or (= (select c_~array v_idx_175) v_v_692_3) (<= v_b_48_3 v_idx_175)) (<= .cse32 10) (<= v_b_49_3 .cse24) (<= c_~n .cse17) (<= 0 .cse21) (or (<= v_b_49_3 v_idx_176) (= v_v_693_3 (select c_~array v_idx_176)) (< v_idx_176 v_b_48_3)) (<= 0 (+ c_ULTIMATE.start_main_~i~7 v_b_48_3 1)) (<= 5 .cse33) (<= .cse18 v_b_49_3) (<= c_ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse33 5) (<= v_b_48_3 .cse18)))))) is different from false [2018-12-24 14:14:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:59,406 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-24 14:14:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:14:59,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-24 14:14:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:59,407 INFO L225 Difference]: With dead ends: 20 [2018-12-24 14:14:59,407 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:14:59,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=31, Invalid=17, Unknown=14, NotChecked=210, Total=272 [2018-12-24 14:14:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:14:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-24 14:14:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-24 14:14:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-24 14:14:59,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-12-24 14:14:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:59,426 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-24 14:14:59,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:14:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-24 14:14:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-24 14:14:59,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:59,427 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:14:59,427 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 950529386, now seen corresponding path program 2 times [2018-12-24 14:14:59,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:59,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:59,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:59,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:59,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-24 14:14:59,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:14:59,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-24 14:14:59,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:14:59,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:14:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:14:59,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:14:59,519 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-24 14:14:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:59,569 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-24 14:14:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:14:59,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-24 14:14:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:59,570 INFO L225 Difference]: With dead ends: 14 [2018-12-24 14:14:59,570 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 14:14:59,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:14:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 14:14:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 14:14:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 14:14:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 14:14:59,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-12-24 14:14:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:59,572 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 14:14:59,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:14:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 14:14:59,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 14:14:59,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 14:15:27,040 WARN L181 SmtUtils]: Spent 27.39 s on a formula simplification. DAG size of input: 201 DAG size of output: 107 [2018-12-24 14:16:21,886 WARN L181 SmtUtils]: Spent 54.81 s on a formula simplification. DAG size of input: 328 DAG size of output: 110 [2018-12-24 14:16:50,249 WARN L181 SmtUtils]: Spent 28.36 s on a formula simplification. DAG size of input: 303 DAG size of output: 178 [2018-12-24 14:16:50,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-12-24 14:16:50,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-24 14:16:50,254 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-12-24 14:16:50,255 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (forall ((v_idx_72 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse12 (+ ULTIMATE.start_SelectionSort_~i~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse18 (+ v_b_50_2 ULTIMATE.start_SelectionSort_~i~4)) (.cse19 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2)) (.cse22 (+ v_b_49_2 1)) (.cse4 (+ v_b_50_2 v_v_641_2)) (.cse15 (+ v_b_50_2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse13 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~i~4)) (.cse11 (+ ULTIMATE.start_SelectionSort_~i~4 ~n)) (.cse27 (* 2 v_v_641_2)) (.cse25 (+ ULTIMATE.start_SelectionSort_~i~4 v_v_641_2)) (.cse14 (+ v_b_49_2 v_v_641_2)) (.cse26 (+ v_v_641_2 1)) (.cse17 (+ v_v_641_2 ~n)) (.cse20 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse31 (* 2 ~n)) (.cse24 (+ ULTIMATE.start_SelectionSort_~i~4 4)) (.cse21 (+ v_b_49_2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse6 (+ v_v_641_2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse10 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse5 (* 2 v_b_50_2)) (.cse9 (+ v_b_49_2 5)) (.cse33 (+ v_b_49_2 ~n)) (.cse0 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse23 (+ ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse29 (* 2 v_b_49_2)) (.cse28 (+ v_b_50_2 ~n)) (.cse35 (+ v_b_49_2 ULTIMATE.start_SelectionSort_~i~4)) (.cse2 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse30 (* 2 ULTIMATE.start_SelectionSort_~i~4)) (.cse7 (+ ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse8 (+ v_b_50_2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse34 (* 2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse32 (+ v_v_641_2 5)) (.cse1 (+ ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2)) (.cse3 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse16 (+ v_b_50_2 v_b_49_2)) (.cse36 (+ ULTIMATE.start_SelectionSort_~rh~4 ~n))) (and (<= v_v_641_2 v_b_49_2) (<= ~n .cse0) (<= 0 .cse1) (<= ULTIMATE.start_SelectionSort_~i~4 .cse2) (or (= v_v_642_2 (select ~array v_idx_72)) (< v_idx_72 v_b_50_2)) (<= .cse3 0) (<= .cse4 5) (<= .cse5 10) (<= .cse6 0) (<= v_b_50_2 .cse7) (<= ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2) (<= .cse8 5) (<= ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2) (<= ULTIMATE.start_SelectionSort_~rh~4 v_v_641_2) (<= v_b_50_2 .cse9) (<= 0 .cse10) (<= .cse11 6) (<= .cse12 1) (<= .cse13 1) (<= 0 .cse14) (<= .cse15 5) (<= 5 .cse16) (<= v_b_49_2 v_v_641_2) (<= 5 .cse17) (<= 6 .cse18) (<= 1 .cse12) (<= 0 .cse19) (<= ULTIMATE.start_SelectionSort_~rh~4 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse18 6) (<= .cse20 5) (<= .cse21 0) (<= .cse22 ULTIMATE.start_SelectionSort_~i~4) (<= .cse23 ULTIMATE.start_SelectionSort_~i~4) (<= .cse19 0) (<= .cse24 v_b_50_2) (<= .cse7 ~n) (<= 1 .cse25) (<= ULTIMATE.start_SelectionSort_~i~4 .cse22) (<= v_b_50_2 .cse0) (<= ULTIMATE.start_SelectionSort_~i~4 .cse26) (<= 5 .cse4) (<= .cse27 0) (<= ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_50_2 .cse24) (<= 10 .cse28) (<= 5 .cse15) (<= 1 .cse13) (<= ~n v_b_50_2) (<= 6 .cse11) (<= .cse29 0) (<= 2 .cse30) (<= 0 .cse27) (<= .cse25 1) (<= .cse14 0) (<= .cse31 10) (<= .cse26 ULTIMATE.start_SelectionSort_~i~4) (<= ~n .cse24) (<= ~n .cse9) (<= .cse0 v_b_50_2) (<= .cse17 5) (<= 5 .cse20) (<= 10 .cse31) (<= .cse24 ~n) (<= 0 .cse21) (<= 0 .cse6) (<= v_b_50_2 ~n) (<= .cse10 0) (<= ~n .cse32) (<= 10 .cse5) (<= 5 .cse33) (<= .cse9 v_b_50_2) (<= .cse9 ~n) (<= .cse34 0) (<= .cse33 5) (or (<= v_b_49_2 v_idx_70) (= v_v_640_2 (select ~array v_idx_70))) (<= .cse0 ~n) (<= ULTIMATE.start_SelectionSort_~i~4 .cse23) (<= v_b_50_2 .cse32) (<= 0 .cse29) (<= 1 .cse35) (<= 5 .cse36) (<= .cse28 10) (<= v_v_641_2 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse35 1) (<= v_v_641_2 ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_49_2 ULTIMATE.start_SelectionSort_~rh~4) (<= ~n .cse7) (<= .cse2 ULTIMATE.start_SelectionSort_~i~4) (<= .cse32 ~n) (<= .cse30 2) (<= .cse7 v_b_50_2) (<= 5 .cse8) (<= ULTIMATE.start_SelectionSort_~rh~4 v_b_49_2) (<= v_b_49_2 ULTIMATE.start_SelectionSort_~lh~4) (<= 0 .cse34) (<= .cse32 v_b_50_2) (<= .cse1 0) (<= 0 .cse3) (or (<= v_b_50_2 v_idx_71) (= v_v_641_2 (select ~array v_idx_71)) (< v_idx_71 v_b_49_2)) (<= .cse16 5) (<= .cse36 5))))) (<= (* 2 ULTIMATE.start_main_~i~7) 8) (<= 4 (+ ULTIMATE.start_main_~i~7 ~n))) [2018-12-24 14:16:50,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2018-12-24 14:16:50,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-12-24 14:16:50,256 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int)) (exists ((v_b_50_2 Int) (v_b_49_2 Int) (v_v_640_2 Int) (v_v_642_2 Int) (v_v_641_2 Int)) (let ((.cse5 (* 2 ~n)) (.cse3 (+ v_b_49_2 v_v_641_2)) (.cse9 (+ v_v_641_2 ~n)) (.cse6 (* 2 v_b_50_2)) (.cse10 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse8 (+ v_b_49_2 5)) (.cse13 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2)) (.cse14 (+ v_b_49_2 ~n)) (.cse0 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse4 (+ v_b_50_2 v_v_641_2)) (.cse7 (+ v_b_50_2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse16 (+ v_b_50_2 ~n)) (.cse12 (+ v_v_641_2 5)) (.cse1 (+ ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2)) (.cse2 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse11 (+ v_b_50_2 v_b_49_2)) (.cse15 (* 2 v_b_49_2)) (.cse17 (* 2 v_v_641_2))) (and (or (< v_idx_68 v_b_49_2) (<= v_b_50_2 v_idx_68) (= v_v_641_2 (select ~array v_idx_68))) (<= v_v_641_2 v_b_49_2) (<= ~n .cse0) (<= 0 .cse1) (or (< v_idx_69 v_b_50_2) (= v_v_642_2 (select ~array v_idx_69))) (<= .cse2 0) (<= .cse3 0) (<= .cse4 5) (<= .cse5 10) (<= .cse6 10) (<= ULTIMATE.start_SelectionSort_~lh~4 v_b_49_2) (<= .cse7 5) (<= ~n .cse8) (<= ULTIMATE.start_SelectionSort_~lh~4 v_v_641_2) (<= v_b_50_2 .cse8) (<= .cse0 v_b_50_2) (<= .cse9 5) (<= 5 .cse10) (<= 10 .cse5) (<= 0 .cse3) (<= 5 .cse11) (<= v_b_50_2 ~n) (<= v_b_49_2 v_v_641_2) (<= ~n .cse12) (<= 5 .cse9) (<= 0 .cse13) (<= 10 .cse6) (<= .cse10 5) (<= 5 .cse14) (<= .cse8 v_b_50_2) (<= .cse8 ~n) (<= .cse13 0) (<= .cse14 5) (<= .cse0 ~n) (<= v_b_50_2 .cse12) (<= 0 .cse15) (<= .cse16 10) (<= v_b_50_2 .cse0) (<= v_v_641_2 ULTIMATE.start_SelectionSort_~lh~4) (<= 5 .cse4) (<= .cse17 0) (<= .cse12 ~n) (<= 5 .cse7) (<= v_b_49_2 ULTIMATE.start_SelectionSort_~lh~4) (<= 10 .cse16) (or (<= v_b_49_2 v_idx_67) (= v_v_640_2 (select ~array v_idx_67))) (<= ~n v_b_50_2) (<= .cse12 v_b_50_2) (<= .cse1 0) (<= 0 .cse2) (<= .cse11 5) (<= .cse15 0) (<= 0 .cse17))))) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= (* 2 ULTIMATE.start_main_~i~7) 8)) [2018-12-24 14:16:50,257 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (forall ((v_idx_169 Int) (v_idx_170 Int) (v_idx_171 Int)) (exists ((v_v_692_3 Int) (v_v_693_3 Int) (v_v_694_3 Int) (v_b_48_3 Int) (v_b_49_3 Int)) (let ((.cse2 (* 2 ~n)) (.cse5 (* 2 ULTIMATE.start_main_~i~7)) (.cse6 (+ ULTIMATE.start_main_~i~7 6)) (.cse8 (+ ULTIMATE.start_main_~i~7 v_b_49_3)) (.cse9 (+ v_b_49_3 ~n)) (.cse3 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse12 (+ v_v_693_3 v_b_48_3)) (.cse10 (+ v_v_693_3 ~n)) (.cse14 (* 2 v_v_693_3)) (.cse11 (+ v_v_693_3 v_b_49_3)) (.cse13 (+ v_b_48_3 v_b_49_3)) (.cse15 (* 2 v_b_49_3)) (.cse7 (+ v_v_693_3 5)) (.cse0 (+ v_b_48_3 5)) (.cse4 (* 2 v_b_48_3)) (.cse16 (+ v_b_48_3 ~n)) (.cse1 (+ ULTIMATE.start_main_~i~7 1))) (and (<= v_b_48_3 v_v_693_3) (<= .cse0 ~n) (or (<= v_b_49_3 v_idx_170) (< v_idx_170 v_b_48_3) (= v_v_693_3 (select ~array v_idx_170))) (<= .cse1 ~n) (<= .cse2 10) (<= .cse3 9) (<= .cse4 0) (or (<= v_b_48_3 v_idx_169) (= v_v_692_3 (select ~array v_idx_169))) (<= .cse5 8) (<= v_b_49_3 .cse6) (<= 10 .cse2) (<= .cse7 ~n) (<= 0 (+ .cse5 2)) (<= .cse8 9) (<= .cse0 v_b_49_3) (<= (+ ULTIMATE.start_main_~i~7 v_v_693_3) 4) (<= ~n v_b_49_3) (<= v_b_49_3 ~n) (<= ~n .cse6) (<= 4 .cse8) (<= v_v_693_3 v_b_48_3) (<= 10 .cse9) (<= .cse9 10) (<= v_b_49_3 .cse0) (<= 5 .cse10) (<= .cse11 5) (<= .cse12 0) (<= .cse7 v_b_49_3) (<= 4 .cse3) (<= v_v_693_3 .cse1) (<= 0 .cse12) (<= 0 (+ ULTIMATE.start_main_~i~7 v_v_693_3 1)) (<= ULTIMATE.start_main_~i~7 (+ v_v_693_3 4)) (<= .cse10 5) (<= 5 .cse13) (<= ~n .cse7) (<= .cse14 0) (<= 0 .cse14) (<= 5 .cse11) (<= 10 .cse15) (<= (+ ULTIMATE.start_main_~i~7 v_b_48_3) 4) (<= .cse13 5) (<= .cse15 10) (<= v_b_49_3 .cse7) (<= ~n .cse0) (<= 0 .cse4) (<= 0 (+ ULTIMATE.start_main_~i~7 v_b_48_3 1)) (or (= (select ~array v_idx_171) v_v_694_3) (< v_idx_171 v_b_49_3)) (<= 5 .cse16) (<= .cse1 v_b_49_3) (<= ULTIMATE.start_main_~i~7 (+ v_b_48_3 4)) (<= .cse16 5) (<= v_b_48_3 .cse1))))) [2018-12-24 14:16:50,307 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:16:50 BoogieIcfgContainer [2018-12-24 14:16:50,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 14:16:50,308 INFO L168 Benchmark]: Toolchain (without parser) took 196906.27 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -59.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-24 14:16:50,309 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:50,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:50,310 INFO L168 Benchmark]: Boogie Preprocessor took 37.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:50,311 INFO L168 Benchmark]: RCFGBuilder took 392.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:16:50,312 INFO L168 Benchmark]: TraceAbstraction took 196424.63 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -80.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-24 14:16:50,316 INFO L336 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 392.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196424.63 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -80.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((forall v_idx_69 : int, v_idx_67 : int, v_idx_68 : int :: (exists v_b_50_2 : int, v_b_49_2 : int, v_v_640_2 : int, v_v_642_2 : int, v_v_641_2 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((((((v_idx_68 < v_b_49_2 || v_b_50_2 <= v_idx_68) || v_v_641_2 == ~array[v_idx_68]) && v_v_641_2 <= v_b_49_2) && ~n <= SelectionSort_~lh~4 + 5) && 0 <= SelectionSort_~lh~4 + v_v_641_2) && (v_idx_69 < v_b_50_2 || v_v_642_2 == ~array[v_idx_69])) && 2 * SelectionSort_~lh~4 <= 0) && v_b_49_2 + v_v_641_2 <= 0) && v_b_50_2 + v_v_641_2 <= 5) && 2 * ~n <= 10) && 2 * v_b_50_2 <= 10) && SelectionSort_~lh~4 <= v_b_49_2) && v_b_50_2 + SelectionSort_~lh~4 <= 5) && ~n <= v_b_49_2 + 5) && SelectionSort_~lh~4 <= v_v_641_2) && v_b_50_2 <= v_b_49_2 + 5) && SelectionSort_~lh~4 + 5 <= v_b_50_2) && v_v_641_2 + ~n <= 5) && 5 <= SelectionSort_~lh~4 + ~n) && 10 <= 2 * ~n) && 0 <= v_b_49_2 + v_v_641_2) && 5 <= v_b_50_2 + v_b_49_2) && v_b_50_2 <= ~n) && v_b_49_2 <= v_v_641_2) && ~n <= v_v_641_2 + 5) && 5 <= v_v_641_2 + ~n) && 0 <= SelectionSort_~lh~4 + v_b_49_2) && 10 <= 2 * v_b_50_2) && SelectionSort_~lh~4 + ~n <= 5) && 5 <= v_b_49_2 + ~n) && v_b_49_2 + 5 <= v_b_50_2) && v_b_49_2 + 5 <= ~n) && SelectionSort_~lh~4 + v_b_49_2 <= 0) && v_b_49_2 + ~n <= 5) && SelectionSort_~lh~4 + 5 <= ~n) && v_b_50_2 <= v_v_641_2 + 5) && 0 <= 2 * v_b_49_2) && v_b_50_2 + ~n <= 10) && v_b_50_2 <= SelectionSort_~lh~4 + 5) && v_v_641_2 <= SelectionSort_~lh~4) && 5 <= v_b_50_2 + v_v_641_2) && 2 * v_v_641_2 <= 0) && v_v_641_2 + 5 <= ~n) && 5 <= v_b_50_2 + SelectionSort_~lh~4) && v_b_49_2 <= SelectionSort_~lh~4) && 10 <= v_b_50_2 + ~n) && (v_b_49_2 <= v_idx_67 || v_v_640_2 == ~array[v_idx_67])) && ~n <= v_b_50_2) && v_v_641_2 + 5 <= v_b_50_2) && SelectionSort_~lh~4 + v_v_641_2 <= 0) && 0 <= 2 * SelectionSort_~lh~4) && v_b_50_2 + v_b_49_2 <= 5) && 2 * v_b_49_2 <= 0) && 0 <= 2 * v_v_641_2)) && ~n <= main_~i~7 + 6) && 2 * main_~i~7 <= 8 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (forall v_idx_169 : int, v_idx_170 : int, v_idx_171 : int :: (exists v_v_692_3 : int, v_v_693_3 : int, v_v_694_3 : int, v_b_48_3 : int, v_b_49_3 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((((v_b_48_3 <= v_v_693_3 && v_b_48_3 + 5 <= ~n) && ((v_b_49_3 <= v_idx_170 || v_idx_170 < v_b_48_3) || v_v_693_3 == ~array[v_idx_170])) && main_~i~7 + 1 <= ~n) && 2 * ~n <= 10) && main_~i~7 + ~n <= 9) && 2 * v_b_48_3 <= 0) && (v_b_48_3 <= v_idx_169 || v_v_692_3 == ~array[v_idx_169])) && 2 * main_~i~7 <= 8) && v_b_49_3 <= main_~i~7 + 6) && 10 <= 2 * ~n) && v_v_693_3 + 5 <= ~n) && 0 <= 2 * main_~i~7 + 2) && main_~i~7 + v_b_49_3 <= 9) && v_b_48_3 + 5 <= v_b_49_3) && main_~i~7 + v_v_693_3 <= 4) && ~n <= v_b_49_3) && v_b_49_3 <= ~n) && ~n <= main_~i~7 + 6) && 4 <= main_~i~7 + v_b_49_3) && v_v_693_3 <= v_b_48_3) && 10 <= v_b_49_3 + ~n) && v_b_49_3 + ~n <= 10) && v_b_49_3 <= v_b_48_3 + 5) && 5 <= v_v_693_3 + ~n) && v_v_693_3 + v_b_49_3 <= 5) && v_v_693_3 + v_b_48_3 <= 0) && v_v_693_3 + 5 <= v_b_49_3) && 4 <= main_~i~7 + ~n) && v_v_693_3 <= main_~i~7 + 1) && 0 <= v_v_693_3 + v_b_48_3) && 0 <= main_~i~7 + v_v_693_3 + 1) && main_~i~7 <= v_v_693_3 + 4) && v_v_693_3 + ~n <= 5) && 5 <= v_b_48_3 + v_b_49_3) && ~n <= v_v_693_3 + 5) && 2 * v_v_693_3 <= 0) && 0 <= 2 * v_v_693_3) && 5 <= v_v_693_3 + v_b_49_3) && 10 <= 2 * v_b_49_3) && main_~i~7 + v_b_48_3 <= 4) && v_b_48_3 + v_b_49_3 <= 5) && 2 * v_b_49_3 <= 10) && v_b_49_3 <= v_v_693_3 + 5) && ~n <= v_b_48_3 + 5) && 0 <= 2 * v_b_48_3) && 0 <= main_~i~7 + v_b_48_3 + 1) && (~array[v_idx_171] == v_v_694_3 || v_idx_171 < v_b_49_3)) && 5 <= v_b_48_3 + ~n) && main_~i~7 + 1 <= v_b_49_3) && main_~i~7 <= v_b_48_3 + 4) && v_b_48_3 + ~n <= 5) && v_b_48_3 <= main_~i~7 + 1)) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((forall v_idx_72 : int, v_idx_70 : int, v_idx_71 : int :: (exists v_b_50_2 : int, v_b_49_2 : int, v_v_640_2 : int, v_v_642_2 : int, v_v_641_2 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((v_v_641_2 <= v_b_49_2 && ~n <= SelectionSort_~lh~4 + 5) && 0 <= SelectionSort_~lh~4 + v_v_641_2) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && (v_v_642_2 == ~array[v_idx_72] || v_idx_72 < v_b_50_2)) && 2 * SelectionSort_~lh~4 <= 0) && v_b_50_2 + v_v_641_2 <= 5) && 2 * v_b_50_2 <= 10) && v_v_641_2 + SelectionSort_~rh~4 <= 0) && v_b_50_2 <= SelectionSort_~rh~4 + 5) && SelectionSort_~lh~4 <= v_b_49_2) && v_b_50_2 + SelectionSort_~lh~4 <= 5) && SelectionSort_~lh~4 <= v_v_641_2) && SelectionSort_~rh~4 <= v_v_641_2) && v_b_50_2 <= v_b_49_2 + 5) && 0 <= SelectionSort_~lh~4 + SelectionSort_~rh~4) && SelectionSort_~i~4 + ~n <= 6) && SelectionSort_~i~4 + SelectionSort_~rh~4 <= 1) && SelectionSort_~lh~4 + SelectionSort_~i~4 <= 1) && 0 <= v_b_49_2 + v_v_641_2) && v_b_50_2 + SelectionSort_~rh~4 <= 5) && 5 <= v_b_50_2 + v_b_49_2) && v_b_49_2 <= v_v_641_2) && 5 <= v_v_641_2 + ~n) && 6 <= v_b_50_2 + SelectionSort_~i~4) && 1 <= SelectionSort_~i~4 + SelectionSort_~rh~4) && 0 <= SelectionSort_~lh~4 + v_b_49_2) && SelectionSort_~rh~4 <= SelectionSort_~lh~4) && v_b_50_2 + SelectionSort_~i~4 <= 6) && SelectionSort_~lh~4 + ~n <= 5) && v_b_49_2 + SelectionSort_~rh~4 <= 0) && v_b_49_2 + 1 <= SelectionSort_~i~4) && SelectionSort_~rh~4 + 1 <= SelectionSort_~i~4) && SelectionSort_~lh~4 + v_b_49_2 <= 0) && SelectionSort_~i~4 + 4 <= v_b_50_2) && SelectionSort_~rh~4 + 5 <= ~n) && 1 <= SelectionSort_~i~4 + v_v_641_2) && SelectionSort_~i~4 <= v_b_49_2 + 1) && v_b_50_2 <= SelectionSort_~lh~4 + 5) && SelectionSort_~i~4 <= v_v_641_2 + 1) && 5 <= v_b_50_2 + v_v_641_2) && 2 * v_v_641_2 <= 0) && SelectionSort_~lh~4 <= SelectionSort_~rh~4) && v_b_50_2 <= SelectionSort_~i~4 + 4) && 10 <= v_b_50_2 + ~n) && 5 <= v_b_50_2 + SelectionSort_~rh~4) && 1 <= SelectionSort_~lh~4 + SelectionSort_~i~4) && ~n <= v_b_50_2) && 6 <= SelectionSort_~i~4 + ~n) && 2 * v_b_49_2 <= 0) && 2 <= 2 * SelectionSort_~i~4) && 0 <= 2 * v_v_641_2) && SelectionSort_~i~4 + v_v_641_2 <= 1) && v_b_49_2 + v_v_641_2 <= 0) && 2 * ~n <= 10) && v_v_641_2 + 1 <= SelectionSort_~i~4) && ~n <= SelectionSort_~i~4 + 4) && ~n <= v_b_49_2 + 5) && SelectionSort_~lh~4 + 5 <= v_b_50_2) && v_v_641_2 + ~n <= 5) && 5 <= SelectionSort_~lh~4 + ~n) && 10 <= 2 * ~n) && SelectionSort_~i~4 + 4 <= ~n) && 0 <= v_b_49_2 + SelectionSort_~rh~4) && 0 <= v_v_641_2 + SelectionSort_~rh~4) && v_b_50_2 <= ~n) && SelectionSort_~lh~4 + SelectionSort_~rh~4 <= 0) && ~n <= v_v_641_2 + 5) && 10 <= 2 * v_b_50_2) && 5 <= v_b_49_2 + ~n) && v_b_49_2 + 5 <= v_b_50_2) && v_b_49_2 + 5 <= ~n) && 2 * SelectionSort_~rh~4 <= 0) && v_b_49_2 + ~n <= 5) && (v_b_49_2 <= v_idx_70 || v_v_640_2 == ~array[v_idx_70])) && SelectionSort_~lh~4 + 5 <= ~n) && SelectionSort_~i~4 <= SelectionSort_~rh~4 + 1) && v_b_50_2 <= v_v_641_2 + 5) && 0 <= 2 * v_b_49_2) && 1 <= v_b_49_2 + SelectionSort_~i~4) && 5 <= SelectionSort_~rh~4 + ~n) && v_b_50_2 + ~n <= 10) && v_v_641_2 <= SelectionSort_~lh~4) && v_b_49_2 + SelectionSort_~i~4 <= 1) && v_v_641_2 <= SelectionSort_~rh~4) && v_b_49_2 <= SelectionSort_~rh~4) && ~n <= SelectionSort_~rh~4 + 5) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && v_v_641_2 + 5 <= ~n) && 2 * SelectionSort_~i~4 <= 2) && SelectionSort_~rh~4 + 5 <= v_b_50_2) && 5 <= v_b_50_2 + SelectionSort_~lh~4) && SelectionSort_~rh~4 <= v_b_49_2) && v_b_49_2 <= SelectionSort_~lh~4) && 0 <= 2 * SelectionSort_~rh~4) && v_v_641_2 + 5 <= v_b_50_2) && SelectionSort_~lh~4 + v_v_641_2 <= 0) && 0 <= 2 * SelectionSort_~lh~4) && ((v_b_50_2 <= v_idx_71 || v_v_641_2 == ~array[v_idx_71]) || v_idx_71 < v_b_49_2)) && v_b_50_2 + v_b_49_2 <= 5) && SelectionSort_~rh~4 + ~n <= 5)) && 2 * main_~i~7 <= 8) && 4 <= main_~i~7 + ~n - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 196.3s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 43.6s AutomataDifference, 0.0s DeadEndRemovalTime, 110.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 20 SDslu, 63 SDs, 0 SdLazy, 83 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 43.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.9s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.8634920634920636 AbsIntWeakeningRatio, 2.0476190476190474 AbsIntAvgWeakeningVarsNumRemoved, -1.6666666666666667 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 14 NumberOfFragments, 1064 HoareAnnotationTreeSize, 4 FomulaSimplifications, 148 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 7722 FormulaSimplificationTreeSizeReductionInter, 110.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 2222 SizeOfPredicates, 2 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 65/125 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...