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/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:39:30,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:39:30,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:39:30,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:39:30,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:39:30,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:39:30,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:39:30,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:39:30,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:39:30,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:39:30,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:39:30,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:39:30,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:39:30,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:39:30,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:39:30,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:39:30,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:39:30,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:39:30,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:39:30,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:39:30,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:39:30,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:39:30,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:39:30,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:39:30,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:39:30,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:39:30,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:39:30,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:39:30,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:39:30,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:39:30,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:39:30,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:39:30,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:39:30,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:39:30,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:39:30,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:39:30,234 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 [2019-02-25 15:39:30,255 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:39:30,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:39:30,257 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:39:30,257 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:39:30,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:39:30,257 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:39:30,258 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:39:30,258 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:39:30,258 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:39:30,258 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:39:30,258 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:39:30,259 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:39:30,259 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:39:30,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:39:30,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:39:30,260 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:39:30,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:39:30,260 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:39:30,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:39:30,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:39:30,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:39:30,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:39:30,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:39:30,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:39:30,262 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:39:30,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:39:30,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:39:30,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:39:30,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:39:30,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:39:30,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:39:30,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:39:30,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:39:30,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:39:30,264 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:39:30,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:39:30,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:39:30,264 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:39:30,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:39:30,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:39:30,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:39:30,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:39:30,318 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:39:30,319 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:39:30,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-02-25 15:39:30,320 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-02-25 15:39:30,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:39:30,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:39:30,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:39:30,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:39:30,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:39:30,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,389 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:39:30,389 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:39:30,390 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:39:30,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:39:30,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:39:30,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:39:30,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:39:30,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/1) ... [2019-02-25 15:39:30,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:39:30,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:39:30,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:39:30,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:39:30,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (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 [2019-02-25 15:39:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-02-25 15:39:30,487 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-02-25 15:39:30,663 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:39:30,663 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-25 15:39:30,664 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:39:30 BoogieIcfgContainer [2019-02-25 15:39:30,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:39:30,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:39:30,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:39:30,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:39:30,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:39:30" (1/2) ... [2019-02-25 15:39:30,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d083a2 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:39:30, skipping insertion in model container [2019-02-25 15:39:30,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:39:30" (2/2) ... [2019-02-25 15:39:30,673 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-02-25 15:39:30,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:39:30,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:39:30,711 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:39:30,752 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:39:30,753 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:39:30,753 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:39:30,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:39:30,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:39:30,753 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:39:30,753 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:39:30,754 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:39:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-02-25 15:39:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:39:30,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:30,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:39:30,791 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-02-25 15:39:30,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:30,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:30,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:39:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:39:30,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:39:30,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:39:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:39:30,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:39:30,988 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-02-25 15:39:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:31,038 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-25 15:39:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:39:31,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:39:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:31,052 INFO L225 Difference]: With dead ends: 7 [2019-02-25 15:39:31,053 INFO L226 Difference]: Without dead ends: 4 [2019-02-25 15:39:31,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:39:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-02-25 15:39:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-02-25 15:39:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-25 15:39:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-02-25 15:39:31,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-02-25 15:39:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:31,087 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-02-25 15:39:31,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:39:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-25 15:39:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:39:31,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:31,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:39:31,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-02-25 15:39:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:31,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:31,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:31,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:31,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:39:31,280 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-02-25 15:39:31,424 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:39:31,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:39:32,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:39:32,611 INFO L272 AbstractInterpreter]: Visited 3 different actions 17 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:39:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:32,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:39:32,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:32,618 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 [2019-02-25 15:39:32,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:32,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:32,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:39:32,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:32,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:32,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:32,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-02-25 15:39:32,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:32,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:39:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:39:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:39:32,999 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-02-25 15:39:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:33,080 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-25 15:39:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:39:33,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:39:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:33,082 INFO L225 Difference]: With dead ends: 6 [2019-02-25 15:39:33,083 INFO L226 Difference]: Without dead ends: 5 [2019-02-25 15:39:33,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:39:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-25 15:39:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-25 15:39:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-25 15:39:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-25 15:39:33,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-25 15:39:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:33,089 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-25 15:39:33,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:39:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-25 15:39:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:39:33,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:33,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-02-25 15:39:33,092 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-02-25 15:39:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:33,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:33,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:33,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:33,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:33,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:33,244 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 [2019-02-25 15:39:33,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:33,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:33,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:39:33,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:33,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:39:33,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:33,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-02-25 15:39:33,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:33,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:39:33,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:39:33,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:39:33,515 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-02-25 15:39:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:33,537 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-25 15:39:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:39:33,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-25 15:39:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:33,539 INFO L225 Difference]: With dead ends: 7 [2019-02-25 15:39:33,539 INFO L226 Difference]: Without dead ends: 6 [2019-02-25 15:39:33,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:39:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-25 15:39:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-25 15:39:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:39:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-25 15:39:33,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-25 15:39:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:33,543 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-25 15:39:33,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:39:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-25 15:39:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:39:33,544 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:33,544 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-02-25 15:39:33,544 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-02-25 15:39:33,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:33,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:33,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:33,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:33,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:33,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:33,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:33,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:33,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:33,777 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 [2019-02-25 15:39:33,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:33,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:33,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:33,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:33,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:39:33,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:33,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-02-25 15:39:34,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:34,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:39:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:39:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:39:34,157 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-02-25 15:39:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:34,209 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-25 15:39:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:39:34,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:39:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:34,211 INFO L225 Difference]: With dead ends: 8 [2019-02-25 15:39:34,211 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:39:34,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:39:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:39:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:39:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:39:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:39:34,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-25 15:39:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:34,214 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:39:34,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:39:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:39:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:39:34,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:34,215 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-02-25 15:39:34,215 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-02-25 15:39:34,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:34,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:34,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:34,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:34,347 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:34,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:34,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:39:34,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-02-25 15:39:34,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:34,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:39:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:39:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:39:34,503 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-02-25 15:39:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:34,528 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-25 15:39:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:39:34,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:39:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:34,529 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:39:34,530 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:39:34,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:39:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:39:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-25 15:39:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:39:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-25 15:39:34,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-25 15:39:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:34,535 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-25 15:39:34,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:39:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-25 15:39:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:39:34,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:34,535 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-02-25 15:39:34,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-02-25 15:39:34,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:34,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:34,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:34,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:34,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:34,636 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:34,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:34,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:39:34,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:34,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:39:34,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:34,769 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:39:34,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-02-25 15:39:34,775 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:39:34,861 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:39:34,861 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-02-25 15:39:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:39:35,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:39:35,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:35,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-02-25 15:39:35,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:35,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:39:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:39:35,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:39:35,415 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-02-25 15:39:35,621 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-02-25 15:39:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:36,002 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-25 15:39:36,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:39:36,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:39:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:36,003 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:39:36,003 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:39:36,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:39:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:39:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:39:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:39:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:39:36,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-25 15:39:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:36,006 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:39:36,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:39:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:39:36,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:39:36,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:39:36,184 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-02-25 15:39:36,187 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-02-25 15:39:36,187 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2019-02-25 15:39:36,187 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-02-25 15:39:36,187 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-02-25 15:39:36,196 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:39:36 BoogieIcfgContainer [2019-02-25 15:39:36,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:39:36,197 INFO L168 Benchmark]: Toolchain (without parser) took 5843.69 ms. Allocated memory was 140.0 MB in the beginning and 261.1 MB in the end (delta: 121.1 MB). Free memory was 107.8 MB in the beginning and 160.0 MB in the end (delta: -52.2 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:36,199 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:39:36,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 105.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:36,200 INFO L168 Benchmark]: Boogie Preprocessor took 23.39 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:36,201 INFO L168 Benchmark]: RCFGBuilder took 247.66 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 96.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:36,202 INFO L168 Benchmark]: TraceAbstraction took 5531.31 ms. Allocated memory was 140.0 MB in the beginning and 261.1 MB in the end (delta: 121.1 MB). Free memory was 96.1 MB in the beginning and 160.0 MB in the end (delta: -63.9 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:36,206 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.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 105.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.39 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 247.66 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 96.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5531.31 ms. Allocated memory was 140.0 MB in the beginning and 261.1 MB in the end (delta: 121.1 MB). Free memory was 96.1 MB in the beginning and 160.0 MB in the end (delta: -63.9 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 38 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 52 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 5 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 22/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...