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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:59:03,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:59:03,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:59:03,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:59:03,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:59:03,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:59:03,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:59:03,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:59:03,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:59:03,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:59:03,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:59:03,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:59:03,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:59:03,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:59:03,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:59:03,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:59:03,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:59:03,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:59:03,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:59:03,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:59:03,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:59:03,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:59:03,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:59:03,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:59:03,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:59:03,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:59:03,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:59:03,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:59:03,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:59:03,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:59:03,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:59:03,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:59:03,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:59:03,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:59:03,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:59:03,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:59:03,543 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:59:03,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:59:03,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:59:03,557 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:59:03,557 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:59:03,557 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:59:03,557 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:59:03,557 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:59:03,558 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:59:03,558 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:59:03,558 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:59:03,558 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:59:03,558 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:59:03,559 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:59:03,559 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:59:03,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:59:03,560 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:59:03,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:59:03,560 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:59:03,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:59:03,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:59:03,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:59:03,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:59:03,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:59:03,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:59:03,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:59:03,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:59:03,562 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:59:03,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:59:03,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:59:03,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:59:03,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:59:03,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:59:03,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:59:03,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:59:03,563 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:59:03,564 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:59:03,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:59:03,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:59:03,564 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:59:03,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:59:03,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:59:03,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:59:03,615 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:59:03,616 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:59:03,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-12-03 17:59:03,617 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl' [2018-12-03 17:59:03,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:59:03,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:59:03,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:59:03,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:59:03,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:59:03,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:59:03,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:59:03,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:59:03,758 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:59:03,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/1) ... [2018-12-03 17:59:03,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:59:03,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:59:03,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:59:03,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:59:03,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (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 17:59:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:59:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:59:04,568 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:59:04,568 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:59:04,569 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:59:04 BoogieIcfgContainer [2018-12-03 17:59:04,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:59:04,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:59:04,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:59:04,574 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:59:04,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:03" (1/2) ... [2018-12-03 17:59:04,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f857c8 and model type pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:59:04, skipping insertion in model container [2018-12-03 17:59:04,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:59:04" (2/2) ... [2018-12-03 17:59:04,577 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-12-03 17:59:04,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:59:04,595 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:59:04,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:59:04,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:59:04,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:59:04,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:59:04,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:59:04,648 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:59:04,649 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:59:04,649 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:59:04,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:59:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 17:59:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:04,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:04,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:04,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:04,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-12-03 17:59:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:04,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:04,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:04,930 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 17:59:04,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:04,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:04,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:04,958 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 17:59:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:05,022 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-03 17:59:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:05,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:05,034 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:59:05,034 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:59:05,039 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 17:59:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:59:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 17:59:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:59:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-12-03 17:59:05,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-12-03 17:59:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:05,085 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-12-03 17:59:05,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-12-03 17:59:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:05,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:05,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:05,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:05,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-12-03 17:59:05,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:05,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:05,207 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 17:59:05,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:05,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:05,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:05,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:05,211 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-12-03 17:59:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:05,273 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-12-03 17:59:05,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:05,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:05,275 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:59:05,278 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:59:05,279 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 17:59:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:59:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 17:59:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:59:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-12-03 17:59:05,318 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-12-03 17:59:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:05,319 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-12-03 17:59:05,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-12-03 17:59:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:05,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:05,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:05,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:05,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:05,321 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-12-03 17:59:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:05,487 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 17:59:05,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:05,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:05,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:05,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:05,490 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-12-03 17:59:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:05,533 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-12-03 17:59:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:05,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:05,538 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:59:05,539 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:59:05,540 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 17:59:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:59:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-12-03 17:59:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 17:59:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-12-03 17:59:05,568 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-12-03 17:59:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:05,569 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-12-03 17:59:05,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-12-03 17:59:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:05,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:05,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:05,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:05,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-12-03 17:59:05,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:05,688 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 17:59:05,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:05,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:05,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:05,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:05,690 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-12-03 17:59:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:05,792 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-12-03 17:59:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:05,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:05,797 INFO L225 Difference]: With dead ends: 367 [2018-12-03 17:59:05,797 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 17:59:05,804 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 17:59:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 17:59:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-03 17:59:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 17:59:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-12-03 17:59:05,870 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-12-03 17:59:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:05,872 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-12-03 17:59:05,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-12-03 17:59:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:05,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:05,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:05,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:05,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-12-03 17:59:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:05,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:05,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:05,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:06,002 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 17:59:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:59:06,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:06,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:59:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:59:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:06,004 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-12-03 17:59:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:06,234 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-12-03 17:59:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:59:06,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 17:59:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:06,238 INFO L225 Difference]: With dead ends: 517 [2018-12-03 17:59:06,238 INFO L226 Difference]: Without dead ends: 515 [2018-12-03 17:59:06,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:59:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-03 17:59:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-12-03 17:59:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 17:59:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-12-03 17:59:06,317 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-12-03 17:59:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:06,318 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-12-03 17:59:06,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:59:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-12-03 17:59:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:06,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:06,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:06,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:06,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-12-03 17:59:06,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:06,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:06,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:06,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:06,592 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-03 17:59:06,594 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 17:59:06,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:06,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:06,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:06,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:59:06,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:59:06,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:06,596 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-12-03 17:59:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:06,933 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-12-03 17:59:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:59:06,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 17:59:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:06,938 INFO L225 Difference]: With dead ends: 879 [2018-12-03 17:59:06,938 INFO L226 Difference]: Without dead ends: 605 [2018-12-03 17:59:06,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-03 17:59:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-12-03 17:59:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-12-03 17:59:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-12-03 17:59:07,052 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-12-03 17:59:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:07,053 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-12-03 17:59:07,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:59:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-12-03 17:59:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:59:07,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:07,060 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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 17:59:07,060 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:07,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-12-03 17:59:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:07,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:07,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:07,306 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:59:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 17:59:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:07,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:07,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:07,319 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-12-03 17:59:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:07,610 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-12-03 17:59:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:07,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 17:59:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:07,618 INFO L225 Difference]: With dead ends: 1809 [2018-12-03 17:59:07,622 INFO L226 Difference]: Without dead ends: 1207 [2018-12-03 17:59:07,628 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 17:59:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-03 17:59:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-12-03 17:59:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-12-03 17:59:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-12-03 17:59:07,847 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-12-03 17:59:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:07,848 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-12-03 17:59:07,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-12-03 17:59:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:59:07,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:07,861 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:59:07,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:07,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-12-03 17:59:07,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:07,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:08,375 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 17:59:08,580 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 17:59:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 17:59:08,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:59:08,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:59:08,736 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-03 17:59:08,738 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [52], [54], [56], [60], [62], [64] [2018-12-03 17:59:08,802 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:59:08,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:59:10,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:59:52,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:59:52,561 INFO L272 AbstractInterpreter]: Visited 25 different actions 272 times. Merged at 23 different actions 183 times. Widened at 16 different actions 37 times. Found 63 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:59:52,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:52,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:59:52,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:59:52,575 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 17:59:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:52,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:59:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:52,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:59:53,241 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 17:59:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 17:59:53,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:59:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 17:59:54,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:59:54,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 17:59:54,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:59:54,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:59:54,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:59:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:59:54,140 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-12-03 17:59:55,292 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 17:59:55,541 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-12-03 17:59:56,744 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 17:59:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:56,934 INFO L93 Difference]: Finished difference Result 2024 states and 2520 transitions. [2018-12-03 17:59:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:59:56,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-03 17:59:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:56,945 INFO L225 Difference]: With dead ends: 2024 [2018-12-03 17:59:56,945 INFO L226 Difference]: Without dead ends: 565 [2018-12-03 17:59:56,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:59:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-03 17:59:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2018-12-03 17:59:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-12-03 17:59:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 442 transitions. [2018-12-03 17:59:57,042 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 442 transitions. Word has length 62 [2018-12-03 17:59:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:57,043 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 442 transitions. [2018-12-03 17:59:57,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:59:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 442 transitions. [2018-12-03 17:59:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:59:57,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:57,044 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:59:57,045 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:57,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-12-03 17:59:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:57,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-03 17:59:57,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:57,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:57,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:57,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:57,148 INFO L87 Difference]: Start difference. First operand 378 states and 442 transitions. Second operand 3 states. [2018-12-03 17:59:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:57,158 INFO L93 Difference]: Finished difference Result 384 states and 448 transitions. [2018-12-03 17:59:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:57,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 17:59:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:57,159 INFO L225 Difference]: With dead ends: 384 [2018-12-03 17:59:57,159 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:59:57,160 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 17:59:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:59:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:59:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:59:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:59:57,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-12-03 17:59:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:57,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:59:57,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:59:57,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:59:57,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:59:57,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:57,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:59:58,475 WARN L180 SmtUtils]: Spent 962.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 17:59:58,795 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-03 17:59:59,588 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 17:59:59,958 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 18:00:00,811 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-03 18:00:00,978 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-03 18:00:01,343 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-03 18:00:02,249 WARN L180 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 18:00:02,505 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-03 18:00:03,174 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-03 18:00:03,375 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-03 18:00:03,560 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-03 18:00:03,563 INFO L444 ceAbstractionStarter]: At program point L440(lines 272 440) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,563 INFO L444 ceAbstractionStarter]: At program point L279(lines 279 290) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,564 INFO L444 ceAbstractionStarter]: At program point L341(lines 333 342) the Hoare annotation is: (let ((.cse13 (div ~mode4 256)) (.cse12 (* 256 (div ~r1 256)))) (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse14 (<= ~r1 (+ .cse12 4))) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse15 (mod v_prenex_1 256))) (and (= .cse15 ~p5_old) (<= .cse15 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (<= .cse13 0)) (.cse10 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse11 .cse6 (<= ~r1 .cse12) (= ~mode4 (* 256 .cse13)) .cse7 .cse9) (and .cse0 .cse10 .cse3 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse14 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9)))) [2018-12-03 18:00:03,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 443) no Hoare annotation was computed. [2018-12-03 18:00:03,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 443) no Hoare annotation was computed. [2018-12-03 18:00:03,564 INFO L444 ceAbstractionStarter]: At program point L346(lines 346 356) the Hoare annotation is: (let ((.cse13 (div ~mode4 256)) (.cse12 (* 256 (div ~r1 256)))) (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse14 (<= ~r1 (+ .cse12 4))) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse15 (mod v_prenex_1 256))) (and (= .cse15 ~p5_old) (<= .cse15 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (<= .cse13 0)) (.cse10 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse11 .cse6 (<= ~r1 .cse12) (= ~mode4 (* 256 .cse13)) .cse7 .cse9) (and .cse0 .cse10 .cse3 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse14 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9)))) [2018-12-03 18:00:03,564 INFO L444 ceAbstractionStarter]: At program point L437(lines 437 441) the Hoare annotation is: false [2018-12-03 18:00:03,565 INFO L444 ceAbstractionStarter]: At program point L363(lines 355 364) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse5 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~r1 .cse12) .cse8 .cse10)))) [2018-12-03 18:00:03,565 INFO L444 ceAbstractionStarter]: At program point L297(lines 289 298) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,565 INFO L444 ceAbstractionStarter]: At program point L421(lines 416 422) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 18:00:03,565 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 443) no Hoare annotation was computed. [2018-12-03 18:00:03,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 442) no Hoare annotation was computed. [2018-12-03 18:00:03,566 INFO L444 ceAbstractionStarter]: At program point L401(lines 401 407) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg))) (.cse8 (<= ~send5 127))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse7 .cse8))) [2018-12-03 18:00:03,566 INFO L444 ceAbstractionStarter]: At program point L368(lines 368 378) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse5 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (<= 0 ~send5)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~r1 .cse12) .cse8 .cse10)))) [2018-12-03 18:00:03,566 INFO L444 ceAbstractionStarter]: At program point L302(lines 302 313) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,566 INFO L444 ceAbstractionStarter]: At program point L385(lines 377 386) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse4 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse5 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 256))) (and (= ~p5_new .cse13) (<= .cse13 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse8 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= ~r1 .cse12) .cse7 .cse8 .cse10)))) [2018-12-03 18:00:03,567 INFO L444 ceAbstractionStarter]: At program point L319(lines 312 320) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,567 INFO L444 ceAbstractionStarter]: At program point L410(lines 406 417) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (<= 0 ~send5)) (.cse4 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg))) (.cse8 (<= ~send5 127))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse5 .cse6 .cse7 .cse8))) [2018-12-03 18:00:03,567 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 438) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (= ULTIMATE.start_assert_~arg 1)) (.cse4 (<= 0 ~send5)) (.cse5 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8 .cse9 .cse10))) [2018-12-03 18:00:03,567 INFO L444 ceAbstractionStarter]: At program point L324(lines 324 334) the Hoare annotation is: (let ((.cse4 (div ~mode4 256))) (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse7 (<= .cse4 0)) (.cse1 (<= ~send3 127)) (.cse8 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse6 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse4)) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= .cse10 ~p5_old) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse3 .cse5 .cse9 .cse6)))) [2018-12-03 18:00:03,605 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:00:03 BoogieIcfgContainer [2018-12-03 18:00:03,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:00:03,606 INFO L168 Benchmark]: Toolchain (without parser) took 59897.55 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 552.9 MB. Max. memory is 7.1 GB. [2018-12-03 18:00:03,607 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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 18:00:03,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.17 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 18:00:03,608 INFO L168 Benchmark]: Boogie Preprocessor took 63.03 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 18:00:03,609 INFO L168 Benchmark]: RCFGBuilder took 745.72 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 18:00:03,610 INFO L168 Benchmark]: TraceAbstraction took 59034.72 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. [2018-12-03 18:00:03,613 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.17 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 63.03 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 745.72 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59034.72 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 442]: 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: 324]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: ((((((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127)) || (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode4 / 256 <= 0) && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 58.9s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 273 SDslu, 241 SDs, 0 SdLazy, 194 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 43.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 281 NumberOfFragments, 2428 HoareAnnotationTreeSize, 16 FomulaSimplifications, 16329 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 780 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 416 ConstructedInterpolants, 7 QuantifiedInterpolants, 77429 SizeOfPredicates, 4 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 498/510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...