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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:40:12,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:40:12,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:40:12,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:40:12,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:40:12,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:40:12,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:40:12,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:40:12,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:40:12,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:40:12,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:40:12,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:40:12,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:40:12,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:40:12,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:40:12,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:40:12,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:40:12,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:40:12,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:40:12,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:40:12,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:40:12,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:40:12,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:40:12,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:40:12,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:40:12,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:40:12,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:40:12,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:40:12,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:40:12,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:40:12,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:40:12,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:40:12,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:40:12,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:40:12,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:40:12,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:40:12,342 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:40:12,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:40:12,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:40:12,356 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:40:12,356 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:40:12,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:40:12,357 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:40:12,357 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:40:12,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:40:12,358 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:40:12,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:40:12,358 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:40:12,358 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:40:12,359 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:40:12,359 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:40:12,359 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:40:12,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:40:12,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:40:12,360 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:40:12,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:40:12,361 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:40:12,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:40:12,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:40:12,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:40:12,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:40:12,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:40:12,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:40:12,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:40:12,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:40:12,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:40:12,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:40:12,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:40:12,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:40:12,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:40:12,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:40:12,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:40:12,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:40:12,364 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:40:12,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:40:12,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:40:12,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:40:12,365 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:40:12,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:40:12,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:40:12,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:40:12,424 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:40:12,425 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:40:12,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl [2018-12-03 15:40:12,426 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl' [2018-12-03 15:40:12,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:40:12,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:40:12,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:12,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:40:12,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:40:12,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:12,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:40:12,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:40:12,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:40:12,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/1) ... [2018-12-03 15:40:12,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:40:12,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:40:12,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:40:12,573 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:40:12,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (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-03 15:40:12,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:40:12,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:40:13,237 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:40:13,237 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:40:13,238 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:13 BoogieIcfgContainer [2018-12-03 15:40:13,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:40:13,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:40:13,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:40:13,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:40:13,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:12" (1/2) ... [2018-12-03 15:40:13,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f895341 and model type pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:40:13, skipping insertion in model container [2018-12-03 15:40:13,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:13" (2/2) ... [2018-12-03 15:40:13,246 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl [2018-12-03 15:40:13,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:40:13,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:40:13,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:40:13,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:40:13,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:40:13,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:40:13,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:40:13,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:40:13,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:40:13,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:40:13,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:40:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 15:40:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:13,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:13,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:13,363 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:13,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 15:40:13,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:13,617 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-03 15:40:13,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:13,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:13,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:13,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:13,644 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 15:40:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:13,700 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 15:40:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:13,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:13,717 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:40:13,717 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:40:13,723 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-03 15:40:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:40:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 15:40:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:40:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 15:40:13,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 15:40:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:13,768 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 15:40:13,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 15:40:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:13,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:13,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:13,771 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:13,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 15:40:13,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:13,900 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-03 15:40:13,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:13,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:13,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:13,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:13,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:13,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:13,904 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 15:40:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:13,953 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 15:40:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:13,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:13,955 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:40:13,955 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:40:13,956 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-03 15:40:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:40:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 15:40:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:40:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 15:40:13,972 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 15:40:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:13,972 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 15:40:13,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 15:40:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:13,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:13,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:13,974 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:13,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 15:40:13,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:13,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:14,077 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-03 15:40:14,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:14,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:14,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:14,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:14,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:14,082 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 15:40:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:14,161 INFO L93 Difference]: Finished difference Result 139 states and 197 transitions. [2018-12-03 15:40:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:14,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:14,165 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:40:14,166 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:40:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:40:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-12-03 15:40:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:40:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-12-03 15:40:14,205 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 15 [2018-12-03 15:40:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:14,205 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-12-03 15:40:14,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-12-03 15:40:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:14,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:14,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:14,210 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:14,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 774424133, now seen corresponding path program 1 times [2018-12-03 15:40:14,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:14,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:14,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:14,438 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-03 15:40:14,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:14,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:40:14,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:14,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:40:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:40:14,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:40:14,442 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 4 states. [2018-12-03 15:40:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:14,587 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2018-12-03 15:40:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:40:14,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 15:40:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:14,591 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:40:14,591 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:40:14,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:40:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:40:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2018-12-03 15:40:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:40:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2018-12-03 15:40:14,627 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 15 [2018-12-03 15:40:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:14,627 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-12-03 15:40:14,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:40:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2018-12-03 15:40:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:14,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:14,631 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:14,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:14,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash 263176883, now seen corresponding path program 1 times [2018-12-03 15:40:14,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:14,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:14,891 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:40:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:14,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:14,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:14,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:14,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:14,897 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand 3 states. [2018-12-03 15:40:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:14,998 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2018-12-03 15:40:14,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:14,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 15:40:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:15,001 INFO L225 Difference]: With dead ends: 267 [2018-12-03 15:40:15,001 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 15:40:15,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 15:40:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-12-03 15:40:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:40:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 15:40:15,049 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 28 [2018-12-03 15:40:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:15,050 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 15:40:15,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 15:40:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:15,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:15,052 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:15,052 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:15,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash -437887695, now seen corresponding path program 1 times [2018-12-03 15:40:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:15,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:15,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:15,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:15,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:15,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:15,212 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 15:40:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:15,322 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 15:40:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:15,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 15:40:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:15,325 INFO L225 Difference]: With dead ends: 525 [2018-12-03 15:40:15,325 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 15:40:15,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 15:40:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 15:40:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 15:40:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 15:40:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 15:40:15,405 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 15:40:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:15,406 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 15:40:15,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 15:40:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:15,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:15,411 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:15,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:15,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2082072239, now seen corresponding path program 1 times [2018-12-03 15:40:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:15,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:15,664 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:40:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:15,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:15,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:15,688 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 15:40:15,693 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [44], [46], [48], [52], [54], [56] [2018-12-03 15:40:15,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:40:15,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:40:16,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:40:16,849 INFO L272 AbstractInterpreter]: Visited 22 different actions 111 times. Merged at 19 different actions 58 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:40:16,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:16,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:40:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:16,895 INFO L192 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-03 15:40:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:16,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:17,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:17,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 15:40:17,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:17,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:40:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:40:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:40:17,531 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-12-03 15:40:17,754 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:40:18,163 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:40:19,260 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 15:40:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:20,319 INFO L93 Difference]: Finished difference Result 791 states and 1017 transitions. [2018-12-03 15:40:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:40:20,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-03 15:40:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:20,321 INFO L225 Difference]: With dead ends: 791 [2018-12-03 15:40:20,321 INFO L226 Difference]: Without dead ends: 287 [2018-12-03 15:40:20,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:40:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-03 15:40:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2018-12-03 15:40:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-03 15:40:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-12-03 15:40:20,380 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 28 [2018-12-03 15:40:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:20,381 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-12-03 15:40:20,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:40:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-12-03 15:40:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:40:20,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:20,384 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:40:20,384 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:20,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1799101551, now seen corresponding path program 2 times [2018-12-03 15:40:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 15:40:20,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:20,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:20,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:20,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:20,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:20,477 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 3 states. [2018-12-03 15:40:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:20,489 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2018-12-03 15:40:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:20,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 15:40:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:20,490 INFO L225 Difference]: With dead ends: 266 [2018-12-03 15:40:20,490 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:40:20,491 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-03 15:40:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:40:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:40:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:40:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:40:20,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 15:40:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:20,493 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:40:20,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:40:20,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:40:20,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:40:21,077 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 15:40:21,560 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 15:40:21,706 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:40:21,811 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:40:21,914 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 15:40:22,171 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 15:40:22,368 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 15:40:22,470 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 15:40:22,591 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:40:22,708 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 15:40:22,800 INFO L444 ceAbstractionStarter]: At program point L316(lines 308 317) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:40:22,801 INFO L444 ceAbstractionStarter]: At program point L250(lines 242 251) the Hoare annotation is: (let ((.cse8 (div ~mode2 256))) (let ((.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 1 ~mode2)) (.cse7 (<= .cse8 0)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse7 .cse4) (and (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse8)) .cse3 .cse4 .cse5) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse9 (mod v_~r1_9 256))) (and (= (+ .cse9 1) ~r1) (<= .cse9 0)))) .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 15:40:22,801 INFO L444 ceAbstractionStarter]: At program point L366(lines 366 370) the Hoare annotation is: false [2018-12-03 15:40:22,801 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 371) no Hoare annotation was computed. [2018-12-03 15:40:22,801 INFO L444 ceAbstractionStarter]: At program point L255(lines 255 265) the Hoare annotation is: (let ((.cse8 (div ~mode2 256))) (let ((.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 1 ~mode2)) (.cse7 (<= .cse8 0)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse7 .cse4) (and (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse8)) .cse3 .cse4 .cse5) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse9 (mod v_~r1_9 256))) (and (= (+ .cse9 1) ~r1) (<= .cse9 0)))) .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 15:40:22,802 INFO L444 ceAbstractionStarter]: At program point L350(lines 345 351) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 15:40:22,802 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 372) no Hoare annotation was computed. [2018-12-03 15:40:22,802 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 372) no Hoare annotation was computed. [2018-12-03 15:40:22,802 INFO L444 ceAbstractionStarter]: At program point L272(lines 264 273) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:40:22,802 INFO L444 ceAbstractionStarter]: At program point L330(lines 330 336) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 15:40:22,802 INFO L444 ceAbstractionStarter]: At program point L231(lines 231 243) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 15:40:22,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 372) no Hoare annotation was computed. [2018-12-03 15:40:22,803 INFO L444 ceAbstractionStarter]: At program point L277(lines 277 287) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:40:22,803 INFO L444 ceAbstractionStarter]: At program point L339(lines 335 346) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 15:40:22,803 INFO L444 ceAbstractionStarter]: At program point L360(lines 360 367) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~85) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 15:40:22,803 INFO L444 ceAbstractionStarter]: At program point L294(lines 286 295) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:40:22,804 INFO L444 ceAbstractionStarter]: At program point L369(lines 224 369) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 15:40:22,804 INFO L444 ceAbstractionStarter]: At program point L299(lines 299 309) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:40:22,827 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:40:22 BoogieIcfgContainer [2018-12-03 15:40:22,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:40:22,828 INFO L168 Benchmark]: Toolchain (without parser) took 10333.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -215.1 MB). Peak memory consumption was 486.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:22,829 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-03 15:40:22,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 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-03 15:40:22,830 INFO L168 Benchmark]: Boogie Preprocessor took 34.02 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-03 15:40:22,831 INFO L168 Benchmark]: RCFGBuilder took 665.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:22,832 INFO L168 Benchmark]: TraceAbstraction took 9588.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -246.8 MB). Peak memory consumption was 455.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:22,836 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.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 Procedure Inliner took 42.01 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 34.02 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 665.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9588.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -246.8 MB). Peak memory consumption was 455.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 371]: 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: 242]: Loop Invariant Derived loop invariant: ((((((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((~mode3 == 256 * (~mode3 / 256) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= ~mode2) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((~mode3 == 256 * (~mode3 / 256) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= ~mode2) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && 1 <= check_~tmp~85) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && 1 <= ~mode2) && 1 <= check_~tmp~85) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 199 SDslu, 164 SDs, 0 SdLazy, 212 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 176 NumberOfFragments, 1250 HoareAnnotationTreeSize, 14 FomulaSimplifications, 7979 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 244 ConstructedInterpolants, 8 QuantifiedInterpolants, 26251 SizeOfPredicates, 1 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 123/143 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...