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_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:46:01,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:46:01,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:46:01,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:46:01,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:46:01,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:46:01,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:46:01,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:46:01,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:46:01,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:46:01,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:46:01,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:46:01,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:46:01,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:46:01,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:46:01,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:46:01,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:46:01,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:46:01,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:46:01,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:46:01,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:46:01,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:46:01,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:46:01,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:46:01,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:46:01,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:46:01,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:46:01,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:46:01,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:46:01,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:46:01,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:46:01,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:46:01,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:46:01,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:46:01,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:46:01,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:46:01,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:46:01,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:46:01,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:46:01,684 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:46:01,688 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:46:01,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:46:01,688 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:46:01,688 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:46:01,689 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:46:01,689 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:46:01,689 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:46:01,689 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:46:01,689 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:46:01,689 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:46:01,690 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:46:01,690 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:46:01,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:46:01,692 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:46:01,692 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:46:01,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:46:01,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:46:01,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:46:01,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:46:01,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:46:01,694 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:46:01,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:46:01,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:46:01,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:46:01,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:46:01,695 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:46:01,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:46:01,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:46:01,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:46:01,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:46:01,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:46:01,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:46:01,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:46:01,697 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:46:01,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:46:01,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:46:01,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:46:01,698 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:46:01,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:46:01,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:46:01,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:46:01,765 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:46:01,766 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:46:01,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-12-03 16:46:01,767 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-12-03 16:46:01,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:46:01,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:46:01,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:01,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:46:01,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:46:01,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:01,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:46:01,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:46:01,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:46:01,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/1) ... [2018-12-03 16:46:01,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:46:01,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:46:01,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:46:01,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:46:01,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (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 16:46:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:46:02,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:46:02,669 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:46:02,670 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 16:46:02,670 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:02 BoogieIcfgContainer [2018-12-03 16:46:02,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:46:02,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:46:02,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:46:02,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:46:02,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:01" (1/2) ... [2018-12-03 16:46:02,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780bfd40 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:46:02, skipping insertion in model container [2018-12-03 16:46:02,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:02" (2/2) ... [2018-12-03 16:46:02,680 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-12-03 16:46:02,692 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:46:02,701 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:46:02,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:46:02,762 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:46:02,763 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:46:02,763 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:46:02,763 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:46:02,763 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:46:02,763 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:46:02,764 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:46:02,764 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:46:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-03 16:46:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:46:02,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:02,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:02,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:02,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-12-03 16:46:02,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:02,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:02,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:03,012 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 16:46:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:03,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:03,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:03,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:03,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,036 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-12-03 16:46:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:03,128 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-12-03 16:46:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:03,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 16:46:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:03,144 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:46:03,145 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:46:03,149 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 16:46:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:46:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:46:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:46:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-12-03 16:46:03,203 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-12-03 16:46:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:03,204 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-12-03 16:46:03,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-12-03 16:46:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:46:03,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:03,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:03,206 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:03,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-12-03 16:46:03,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:03,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:03,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,303 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-12-03 16:46:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:03,367 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-12-03 16:46:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:03,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:46:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:03,369 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:46:03,369 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:46:03,372 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 16:46:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:46:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:46:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:46:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-12-03 16:46:03,383 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-12-03 16:46:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:03,384 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-12-03 16:46:03,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-12-03 16:46:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:46:03,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:03,386 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:03,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:03,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-12-03 16:46:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:03,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:03,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,446 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-12-03 16:46:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:03,511 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-12-03 16:46:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:03,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:46:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:03,514 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:46:03,514 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:46:03,515 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 16:46:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:46:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:46:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:46:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-12-03 16:46:03,527 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-12-03 16:46:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:03,528 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-12-03 16:46:03,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-12-03 16:46:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:46:03,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:03,530 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:03,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:03,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-12-03 16:46:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:03,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:03,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:03,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,586 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-12-03 16:46:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:03,658 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-12-03 16:46:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:03,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 16:46:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:03,660 INFO L225 Difference]: With dead ends: 122 [2018-12-03 16:46:03,660 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:46:03,663 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 16:46:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:46:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:46:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:46:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-03 16:46:03,679 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-12-03 16:46:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:03,679 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-03 16:46:03,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-03 16:46:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:46:03,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:03,685 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:03,686 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:03,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-12-03 16:46:03,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:03,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:03,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:03,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:03,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,792 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-12-03 16:46:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:03,975 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-12-03 16:46:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:03,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 16:46:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:03,977 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:46:03,978 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:46:03,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:46:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:46:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:46:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-12-03 16:46:03,995 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-12-03 16:46:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:03,995 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-12-03 16:46:03,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-12-03 16:46:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:46:03,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:03,997 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:03,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:03,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-12-03 16:46:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:03,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:04,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:04,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:04,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,095 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-12-03 16:46:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:04,215 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-12-03 16:46:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 16:46:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:04,217 INFO L225 Difference]: With dead ends: 235 [2018-12-03 16:46:04,217 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:46:04,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:46:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-12-03 16:46:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:46:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-12-03 16:46:04,240 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-12-03 16:46:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:04,241 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-12-03 16:46:04,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-12-03 16:46:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:46:04,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:04,244 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:04,244 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:04,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-12-03 16:46:04,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:04,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:46:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:04,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,361 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-12-03 16:46:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:04,437 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-12-03 16:46:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:04,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:46:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:04,439 INFO L225 Difference]: With dead ends: 288 [2018-12-03 16:46:04,439 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:46:04,440 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 16:46:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:46:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 16:46:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:46:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-12-03 16:46:04,464 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-12-03 16:46:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:04,465 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-12-03 16:46:04,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-12-03 16:46:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:46:04,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:04,468 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:04,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:04,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-12-03 16:46:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:46:04,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:04,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:04,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,566 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-12-03 16:46:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:04,693 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-12-03 16:46:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:04,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:46:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:04,695 INFO L225 Difference]: With dead ends: 312 [2018-12-03 16:46:04,696 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 16:46:04,697 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 16:46:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 16:46:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 16:46:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 16:46:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-12-03 16:46:04,723 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-12-03 16:46:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:04,724 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-12-03 16:46:04,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-12-03 16:46:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:46:04,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:04,727 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:04,727 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-12-03 16:46:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:46:04,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:04,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:04,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:04,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,819 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-12-03 16:46:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:04,927 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-12-03 16:46:04,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:04,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:46:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:04,931 INFO L225 Difference]: With dead ends: 345 [2018-12-03 16:46:04,931 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 16:46:04,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 16:46:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-12-03 16:46:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:46:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-12-03 16:46:04,966 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-12-03 16:46:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:04,967 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-12-03 16:46:04,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-12-03 16:46:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:46:04,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:04,978 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:04,978 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:04,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-12-03 16:46:04,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:04,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:46:05,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:05,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:05,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:05,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:05,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:05,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:05,074 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-12-03 16:46:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:05,178 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-12-03 16:46:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:05,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 16:46:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:05,181 INFO L225 Difference]: With dead ends: 335 [2018-12-03 16:46:05,183 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 16:46:05,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 16:46:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-12-03 16:46:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 16:46:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-12-03 16:46:05,210 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-12-03 16:46:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:05,210 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-12-03 16:46:05,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-12-03 16:46:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:46:05,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:05,212 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:05,216 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:05,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-12-03 16:46:05,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:05,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:05,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:05,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:05,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:05,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:05,396 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 16:46:05,399 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [16], [22], [26], [32], [34], [38], [44], [46], [50], [56], [58], [60], [62], [66], [68], [72], [76], [83], [85], [89], [95], [97], [101], [105], [109], [113], [119], [121], [127], [131], [137] [2018-12-03 16:46:05,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:46:05,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:46:06,036 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 16:46:06,038 INFO L272 AbstractInterpreter]: Visited 35 different actions 68 times. Merged at 26 different actions 28 times. Never widened. Found 6 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:46:06,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:06,085 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 16:46:06,421 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 61.33% of their original sizes. [2018-12-03 16:46:06,421 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 16:46:09,721 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-03 16:46:09,722 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 16:46:09,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:46:09,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [4] total 40 [2018-12-03 16:46:09,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:09,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:46:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:46:09,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:46:09,726 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 38 states. [2018-12-03 16:46:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:21,055 INFO L93 Difference]: Finished difference Result 348 states and 491 transitions. [2018-12-03 16:46:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:46:21,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2018-12-03 16:46:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:21,057 INFO L225 Difference]: With dead ends: 348 [2018-12-03 16:46:21,057 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 16:46:21,059 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=380, Invalid=3042, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:46:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 16:46:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2018-12-03 16:46:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 16:46:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2018-12-03 16:46:21,083 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 52 [2018-12-03 16:46:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:21,083 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2018-12-03 16:46:21,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:46:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2018-12-03 16:46:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:46:21,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:21,084 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:21,085 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:21,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2052781742, now seen corresponding path program 1 times [2018-12-03 16:46:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:21,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:21,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:46:21,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:21,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:21,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:21,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:21,187 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand 3 states. [2018-12-03 16:46:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:21,320 INFO L93 Difference]: Finished difference Result 382 states and 530 transitions. [2018-12-03 16:46:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:21,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 16:46:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:21,324 INFO L225 Difference]: With dead ends: 382 [2018-12-03 16:46:21,324 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 16:46:21,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 16:46:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 211. [2018-12-03 16:46:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:46:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2018-12-03 16:46:21,357 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 52 [2018-12-03 16:46:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:21,358 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2018-12-03 16:46:21,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2018-12-03 16:46:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:46:21,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:21,359 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:21,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:21,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-12-03 16:46:21,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:46:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:46:21,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:21,414 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2018-12-03 16:46:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:21,516 INFO L93 Difference]: Finished difference Result 560 states and 757 transitions. [2018-12-03 16:46:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:21,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 16:46:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:21,519 INFO L225 Difference]: With dead ends: 560 [2018-12-03 16:46:21,519 INFO L226 Difference]: Without dead ends: 344 [2018-12-03 16:46:21,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-03 16:46:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-12-03 16:46:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-03 16:46:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 453 transitions. [2018-12-03 16:46:21,556 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 453 transitions. Word has length 75 [2018-12-03 16:46:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:21,556 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 453 transitions. [2018-12-03 16:46:21,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 453 transitions. [2018-12-03 16:46:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:46:21,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:21,558 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:21,558 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:21,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-12-03 16:46:21,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:21,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:46:21,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:21,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:21,782 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-03 16:46:21,782 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [60], [62], [66], [68], [72], [74], [76], [81], [83], [85], [89], [91], [95], [97], [101], [103], [105], [109], [111], [113], [117], [119], [121], [125], [127], [131], [133], [137], [139] [2018-12-03 16:46:21,786 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:46:21,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:46:22,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:46:22,933 INFO L272 AbstractInterpreter]: Visited 50 different actions 555 times. Merged at 49 different actions 315 times. Widened at 35 different actions 135 times. Found 146 fixpoints after 33 different actions. Largest state had 0 variables. [2018-12-03 16:46:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:22,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:46:22,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:22,962 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 16:46:22,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:22,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:23,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:46:23,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:46:23,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:46:23,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:23,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:46:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:46:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:46:23,396 INFO L87 Difference]: Start difference. First operand 342 states and 453 transitions. Second operand 8 states. [2018-12-03 16:46:24,198 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 16:46:24,423 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 16:46:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:25,543 INFO L93 Difference]: Finished difference Result 2292 states and 3159 transitions. [2018-12-03 16:46:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:46:25,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-12-03 16:46:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:25,555 INFO L225 Difference]: With dead ends: 2292 [2018-12-03 16:46:25,555 INFO L226 Difference]: Without dead ends: 1986 [2018-12-03 16:46:25,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:46:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-12-03 16:46:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1321. [2018-12-03 16:46:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2018-12-03 16:46:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1847 transitions. [2018-12-03 16:46:25,748 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1847 transitions. Word has length 75 [2018-12-03 16:46:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:25,749 INFO L480 AbstractCegarLoop]: Abstraction has 1321 states and 1847 transitions. [2018-12-03 16:46:25,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:46:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1847 transitions. [2018-12-03 16:46:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:46:25,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:25,751 INFO L402 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:25,751 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:25,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash -696864020, now seen corresponding path program 2 times [2018-12-03 16:46:25,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:25,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:25,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 128 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 16:46:25,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:25,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:25,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:25,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:25,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:25,896 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:25,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:25,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:25,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:46:25,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:25,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 16:46:26,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 16:46:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:46:26,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 16:46:26,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:26,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:46:26,074 INFO L87 Difference]: Start difference. First operand 1321 states and 1847 transitions. Second operand 3 states. [2018-12-03 16:46:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:26,464 INFO L93 Difference]: Finished difference Result 2569 states and 3598 transitions. [2018-12-03 16:46:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:26,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-03 16:46:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:26,470 INFO L225 Difference]: With dead ends: 2569 [2018-12-03 16:46:26,470 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 16:46:26,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:46:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 16:46:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 700. [2018-12-03 16:46:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 16:46:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 946 transitions. [2018-12-03 16:46:26,615 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 946 transitions. Word has length 101 [2018-12-03 16:46:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:26,615 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 946 transitions. [2018-12-03 16:46:26,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2018-12-03 16:46:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:46:26,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:26,617 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:26,617 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 3 times [2018-12-03 16:46:26,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:26,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:26,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:26,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:46:26,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:26,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:26,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:26,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:26,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:26,858 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:26,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:26,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:26,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:26,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:26,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 16:46:27,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 16:46:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:46:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 16:46:27,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:27,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:46:27,175 INFO L87 Difference]: Start difference. First operand 700 states and 946 transitions. Second operand 3 states. [2018-12-03 16:46:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:27,419 INFO L93 Difference]: Finished difference Result 1320 states and 1793 transitions. [2018-12-03 16:46:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:27,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-03 16:46:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:27,424 INFO L225 Difference]: With dead ends: 1320 [2018-12-03 16:46:27,424 INFO L226 Difference]: Without dead ends: 636 [2018-12-03 16:46:27,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:46:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-12-03 16:46:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 612. [2018-12-03 16:46:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 16:46:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 812 transitions. [2018-12-03 16:46:27,587 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 812 transitions. Word has length 102 [2018-12-03 16:46:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:27,587 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 812 transitions. [2018-12-03 16:46:27,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 812 transitions. [2018-12-03 16:46:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:46:27,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:27,589 INFO L402 BasicCegarLoop]: trace histogram [9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:46:27,589 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:27,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -740401578, now seen corresponding path program 4 times [2018-12-03 16:46:27,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:27,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:27,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:46:27,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:27,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:27,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:27,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:27,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:27,810 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:27,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:27,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:27,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 16:46:27,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 16:46:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:46:27,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2018-12-03 16:46:27,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:27,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:46:27,960 INFO L87 Difference]: Start difference. First operand 612 states and 812 transitions. Second operand 3 states. [2018-12-03 16:46:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:28,101 INFO L93 Difference]: Finished difference Result 644 states and 848 transitions. [2018-12-03 16:46:28,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:28,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 16:46:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:28,102 INFO L225 Difference]: With dead ends: 644 [2018-12-03 16:46:28,102 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:46:28,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:46:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:46:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:46:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:46:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:46:28,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-03 16:46:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:28,105 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:46:28,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:46:28,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:46:28,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:46:28,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,647 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 110 [2018-12-03 16:46:28,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:28,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:29,451 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 150 [2018-12-03 16:46:29,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:46:31,300 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 16:46:32,120 WARN L180 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2018-12-03 16:46:33,140 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-12-03 16:46:34,822 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 16:46:35,012 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 16:46:35,411 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-12-03 16:46:35,832 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2018-12-03 16:46:36,364 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-12-03 16:46:36,791 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2018-12-03 16:46:37,179 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2018-12-03 16:46:37,364 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 16:46:37,553 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 16:46:37,886 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2018-12-03 16:46:38,071 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 16:46:38,333 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-03 16:46:38,619 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 16:46:38,874 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-12-03 16:46:39,114 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 16:46:40,601 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-12-03 16:46:41,375 WARN L180 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2018-12-03 16:46:42,402 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-12-03 16:46:43,397 WARN L180 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-12-03 16:46:43,773 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-03 16:46:44,452 WARN L180 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2018-12-03 16:46:44,963 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 73 [2018-12-03 16:46:45,214 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-03 16:46:45,798 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2018-12-03 16:46:46,233 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-03 16:46:46,238 INFO L444 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse16 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse6)) (.cse2 (= ~wl_pc 2)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse5 (<= 1 ~processed)) (.cse8 (<= .cse6 ~c)) (.cse10 (<= ~data .cse6)) (.cse12 (<= .cse6 ~data)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse7 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0))) (.cse14 (not .cse16)) (.cse11 (<= 2 ~e_wl)) (.cse15 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 (not (= ~r_st 0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse9 .cse1 .cse11 .cse7 .cse13 .cse14) (and .cse11 (<= ~t_b ~data) (and .cse16 (= ~t_b 0) (= ~d 0)) (<= ~data ~t_b) (let ((.cse17 (= ~e_f 2)) (.cse18 (= ~c_req_up 0)) (.cse19 (= ~r_st 2)) (.cse20 (= ~e_g 2)) (.cse21 (= ~e_c 2)) (.cse22 (= ~e_e 2)) (.cse23 (= ~c 0))) (or (and .cse17 .cse18 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse19 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse20 .cse21 .cse22 .cse23) (and .cse17 (= ~c1_st 2) .cse18 (= ~c2_pc 1) .cse19 .cse15 (= ~wb_pc 1) .cse20 .cse21 (= ~wb_st 2) (= ~c2_st 2) (= (mod ~e_wl 2) 0) .cse22 (= ~c1_pc 1) .cse23))))))) [2018-12-03 16:46:46,238 INFO L444 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse4 (<= 2 ~e_wl)) (.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0))) (.cse6 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) .cse4 (<= .cse0 ~data) .cse5 .cse6)) (and (<= ~t_b ~data) (= ~c2_pc 1) (<= ~data ~t_b) (= ~wl_pc 1) (= ~wb_pc 1) .cse4 (and (= ~e_g 2) (= ~e_c 2) (= ~e_f 2) (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2) (= ~e_e 2) (= ~r_st 2)) (= (mod ~e_wl 2) 0) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse3 .cse1 (not (= ~r_st 0)) .cse2 .cse5 .cse6))) [2018-12-03 16:46:46,238 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse3 (not (= ~r_st 0))) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) .cse3 (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 .cse3 .cse2 .cse4 .cse5))) [2018-12-03 16:46:46,238 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-12-03 16:46:46,238 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-12-03 16:46:46,239 INFO L444 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse3 (not (= ~r_st 0))) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) .cse3 (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 .cse3 .cse2 .cse4 .cse5))) [2018-12-03 16:46:46,239 INFO L444 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse3 (<= 1 ~c2_pc)) (.cse1 (<= 2 ~e_wl)) (.cse2 (not (= ~r_st 0))) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0))) (.cse6 (= ~wl_pc 1))) (or (and (not (= ~e_c 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse0 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse3 (<= .cse7 ~c) (<= ~data .cse7) .cse1 .cse2 (<= .cse7 ~data) .cse4 .cse5)) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)))) [2018-12-03 16:46:46,239 INFO L444 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse1 (<= 1 ~c1_pc)) (.cse4 (<= 1 ~c2_pc)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 2 ~e_wl)) (.cse3 (not (= ~r_st 0))) (.cse5 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~e_c 0)) .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse1 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 (<= .cse7 ~c) .cse0 (<= ~data .cse7) .cse2 .cse3 (<= .cse7 ~data) .cse5)))) [2018-12-03 16:46:46,239 INFO L444 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse3 .cse4)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 (not (= ~r_st 0)) .cse2 .cse3 .cse4))) [2018-12-03 16:46:46,240 INFO L444 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse34 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse10 (<= ~data .cse6)) (.cse13 (<= .cse6 ~data)) (.cse23 (<= ~t_b ~data)) (.cse32 (= ~t_b 0)) (.cse33 (= ~d 0)) (.cse27 (<= ~data ~t_b)) (.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse24 (= ~c_req_up 0)) (.cse25 (= ~c2_pc 1)) (.cse26 (= ~r_st 2)) (.cse16 (= ~wl_pc 1)) (.cse28 (= ~wb_pc 1)) (.cse29 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~wb_st 2)) (.cse30 (= ~c2_st 2)) (.cse21 (= ~e_e 2)) (.cse22 (= ~c1_pc 1)) (.cse31 (= ~c 0)) (.cse0 (<= ~c_t .cse6)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse12 (not (= ~r_st 0))) (.cse7 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0))) (.cse8 (<= .cse6 ~c)) (.cse15 (not .cse34))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse1 .cse11 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse18 (= ~e_wl 0) .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= ~wl_st 2) .cse31 .cse32 .cse33) (and .cse11 .cse23 (and .cse34 .cse32 .cse33) .cse27 (or (and .cse17 .cse24 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse26 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse29 .cse19 .cse21 .cse31) (and .cse17 .cse18 .cse24 .cse25 .cse26 .cse16 .cse28 .cse29 .cse19 .cse20 .cse30 (= (mod ~e_wl 2) 0) .cse21 .cse22 .cse31))) (and .cse0 .cse9 .cse1 .cse11 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse15)))) [2018-12-03 16:46:46,240 INFO L444 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse4 (= ~wb_st 0)) (.cse0 (= ~wl_pc 1)) (.cse9 (= ~wb_pc 1))) (let ((.cse3 (<= 2 ~e_wl)) (.cse1 (let ((.cse10 (= ~e_f 2)) (.cse11 (= ~c1_st 2)) (.cse12 (= ~c_req_up 0)) (.cse13 (= ~e_g 2)) (.cse14 (= ~e_c 2)) (.cse15 (= ~e_e 2)) (.cse16 (= ~wl_st 2)) (.cse17 (= ~c1_pc 1)) (.cse18 (= ~d 0))) (or (and .cse10 .cse11 .cse12 (= ~c2_pc 0) (= ~e_wl 0) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse10 .cse11 .cse12 (= ~c2_pc 1) .cse9 .cse13 .cse14 (= (mod ~e_wl 2) 0) .cse15 .cse16 .cse17 .cse18)))) (.cse2 (let ((.cse6 (= ~c 0)) (.cse7 (= ~r_st 2)) (.cse8 (= ~t_b 0))) (or (and .cse0 .cse4 .cse6 .cse7 .cse8 (= ~wb_pc 0)) (and .cse9 (= ~wl_pc 2) .cse4 .cse6 .cse7 .cse8))))) (or (and .cse0 (<= ~t_b ~data) .cse1 (<= ~data ~t_b) .cse2) (and (and .cse0 (not (= ~e_c 1)) (<= 1 ~c1_pc) .cse3 .cse4 (<= 1 ~c2_pc) (not (= ~e_c 0))) (not (= ~wl_st 0))) (let ((.cse5 (+ ~t_b 2))) (and (<= ~data .cse5) .cse3 .cse1 .cse2 (<= .cse5 ~data)))))) [2018-12-03 16:46:46,240 INFO L444 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse14 (= ~wl_pc 2)) (.cse15 (= ~wl_pc 1)) (.cse23 (= ~wb_pc 1)) (.cse5 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse5)) (.cse2 (<= ~c .cse5)) (.cse3 (<= .cse5 ~c_t)) (.cse4 (<= 1 ~processed)) (.cse7 (<= .cse5 ~c)) (.cse9 (<= ~data .cse5)) (.cse11 (<= .cse5 ~data)) (.cse16 (let ((.cse24 (= ~e_f 2)) (.cse25 (= ~c1_st 2)) (.cse26 (= ~c_req_up 0)) (.cse27 (= ~c2_st 0)) (.cse28 (= ~e_g 2)) (.cse29 (= ~e_c 2)) (.cse30 (= ~e_e 2)) (.cse31 (= ~wl_st 2)) (.cse32 (= ~c1_pc 1)) (.cse33 (= ~d 0))) (or (and .cse24 .cse25 .cse26 (= ~c2_pc 0) (= ~e_wl 0) .cse27 .cse15 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse24 .cse25 .cse26 (= ~c2_pc 1) .cse27 .cse23 .cse28 .cse29 (= (mod ~e_wl 2) 0) .cse30 .cse31 .cse32 .cse33)))) (.cse17 (let ((.cse19 (= ~wb_st 0)) (.cse20 (= ~c 0)) (.cse21 (= ~r_st 2)) (.cse22 (= ~t_b 0))) (or (and .cse15 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 0)) (and .cse23 .cse14 .cse19 .cse20 .cse21 .cse22)))) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse13 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~d .cse5) .cse6 .cse7 (<= .cse5 ~d) .cse8 .cse9 .cse10 (not (= ~r_st 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 (<= ~t_b ~data) (<= ~data ~t_b) .cse17) (let ((.cse18 (+ ~t_b 1))) (and (<= ~data .cse18) .cse16 .cse10 (= ~processed 0) .cse17 (<= .cse18 ~data))) (and (and .cse15 .cse8 .cse1 .cse10 .cse6 .cse12) .cse13)))) [2018-12-03 16:46:46,240 INFO L444 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse2 (<= ~c .cse4)) (.cse6 (<= .cse4 ~c)) (.cse0 (<= ~c_t .cse4)) (.cse12 (= ~wl_pc 2)) (.cse3 (<= .cse4 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse14 (<= ~data .cse4)) (.cse9 (not (= ~r_st 0))) (.cse15 (<= .cse4 ~data)) (.cse16 (= ~wl_pc 1)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse10 (not (= ~e_c 0))) (.cse11 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~d .cse4) .cse5 .cse6 (<= .cse4 ~d) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse10 .cse11) (and (<= ~t_b ~data) (<= ~data ~t_b) (and (= ~e_f 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (= ~wb_pc 0) (= ~e_g 2) (= ~e_c 2) (= ~c2_st 2) (= ~e_e 2) (= ~wl_st 2) (= ~c1_pc 1) (= ~c 0)) (= ~e_wl 0) .cse16 (= ~t_b 0) (= ~d 0)) (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse10 .cse11) (and (and .cse16 .cse7 .cse1 .cse8 .cse5 .cse10) .cse11)))) [2018-12-03 16:46:46,241 INFO L444 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (let ((.cse0 (<= 2 ~e_wl)) (.cse1 (not (= ~wl_st 0)))) (or (and (<= ~t_b ~data) (= ~c2_pc 1) (<= ~data ~t_b) (= ~wl_pc 1) (= ~wb_pc 1) .cse0 (and (= ~e_g 2) (= ~e_c 2) (= ~e_f 2) (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2) (= ~e_e 2) (= ~r_st 2)) (= (mod ~e_wl 2) 0) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0) .cse1) (and (= ~wl_pc 2) (and (let ((.cse2 (+ ~t_b 2))) (and (<= .cse2 ~d) (not (= ~e_c 1)) (<= 1 ~c1_pc) .cse0 (not (= ~r_st 0)) (<= ~d .cse2) (<= 1 ~c2_pc) (not (= ~e_c 0)))) .cse1)))) [2018-12-03 16:46:46,241 INFO L444 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse5 (= ~c2_st 0))) (let ((.cse1 (<= 2 ~e_wl)) (.cse3 (<= ~t_b ~data)) (.cse6 (let ((.cse8 (= ~e_f 2)) (.cse9 (= ~c_req_up 0)) (.cse10 (= ~r_st 2)) (.cse11 (= ~e_g 2)) (.cse12 (= ~e_c 2)) (.cse13 (= ~e_e 2)) (.cse14 (= ~c 0)) (.cse15 (= ~d 0))) (or (and .cse8 .cse9 (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) .cse10 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) .cse5 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 (= ~c1_st 2) .cse9 (= ~c2_pc 1) .cse10 (= ~wl_pc 1) (= ~wb_pc 1) .cse11 .cse12 (= ~wb_st 2) (= ~c2_st 2) .cse13 (= ~c1_pc 1) .cse14 .cse15)))) (.cse4 (<= ~data ~t_b)) (.cse7 (= ~t_b 0)) (.cse2 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) (<= 1 ~c1_pc) (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) (<= ~d .cse0) (<= 1 ~c2_pc) (<= .cse0 ~c) (<= .cse0 ~d) (not (= ~e_c 1)) (<= ~data .cse0) .cse1 (not (= ~r_st 0)) (<= .cse0 ~data) (not (= ~e_c 0)) .cse2)) (and .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse2) (and .cse1 .cse3 (= (mod ~e_wl 2) 0) .cse6 .cse4 .cse7 .cse2)))) [2018-12-03 16:46:46,241 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-12-03 16:46:46,241 INFO L444 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse8 (= ~wl_st 0))) (let ((.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0))) (.cse6 (not .cse8)) (.cse4 (<= 2 ~e_wl)) (.cse7 (= ~wl_pc 1))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) .cse4 (<= .cse0 ~data) .cse5 .cse6)) (and .cse7 .cse3 .cse1 .cse4 .cse2 .cse5 .cse6) (and .cse4 (<= ~t_b ~data) (and .cse8 (= ~t_b 0) (= ~d 0)) (<= ~data ~t_b) (let ((.cse9 (= ~e_f 2)) (.cse10 (= ~c_req_up 0)) (.cse11 (= ~r_st 2)) (.cse12 (= ~e_g 2)) (.cse13 (= ~e_c 2)) (.cse14 (= ~e_e 2)) (.cse15 (= ~c 0))) (or (and .cse9 .cse10 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse11 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse12 .cse13 .cse14 .cse15) (and .cse9 (= ~c1_st 2) .cse10 (= ~c2_pc 1) .cse11 .cse7 (= ~wb_pc 1) .cse12 .cse13 (= ~wb_st 2) (= ~c2_st 2) (= (mod ~e_wl 2) 0) .cse14 (= ~c1_pc 1) .cse15))))))) [2018-12-03 16:46:46,241 INFO L444 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse14 (= ~wl_pc 1)) (.cse2 (= ~wl_pc 2)) (.cse13 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse13)) (.cse3 (<= ~c .cse13)) (.cse4 (<= .cse13 ~c_t)) (.cse6 (<= .cse13 ~c)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse5 (<= 1 ~c2_pc)) (.cse11 (not (= ~e_c 0))) (.cse12 (not (= ~wl_st 0))) (.cse8 (<= ~data .cse13)) (.cse9 (<= 2 ~e_wl)) (.cse15 (= ~t_b 0)) (.cse10 (<= .cse13 ~data)) (.cse16 (let ((.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse19 (= ~c_req_up 0)) (.cse20 (= ~c2_pc 1)) (.cse21 (= ~r_st 2)) (.cse22 (= ~e_g 2)) (.cse23 (= ~e_c 2)) (.cse24 (= ~c2_st 2)) (.cse25 (= ~e_e 2)) (.cse26 (= ~wl_st 2)) (.cse27 (= ~c1_pc 1)) (.cse28 (= ~c 0)) (.cse29 (= ~d 0))) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 (= ~wb_pc 0) (= ~e_wl 0) .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse2 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~wb_pc 1) .cse22 .cse23 .cse24 (= (mod ~e_wl 2) 0) .cse25 .cse26 .cse27 .cse28 .cse29))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 (<= ~d .cse13) .cse5 .cse6 (<= .cse13 ~d) .cse7 .cse8 .cse9 (not (= ~r_st 0)) .cse10 .cse11 .cse12) (and (<= ~t_b ~data) (<= ~data ~t_b) .cse14 .cse15 .cse16) (and (and .cse14 .cse7 .cse1 .cse9 .cse5 .cse11) .cse12) (and .cse8 .cse9 .cse15 .cse10 .cse16)))) [2018-12-03 16:46:46,242 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse9 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse7 (<= ~c_t .cse9)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~e_wl)) (.cse8 (<= .cse9 ~c_t)) (.cse4 (not (= ~r_st 0))) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0))) (.cse10 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse1 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse7 .cse2 (= ~wl_pc 2) .cse8 (<= 1 ~processed) .cse5 .cse0 (<= ~data .cse9) .cse3 .cse4 (<= .cse9 ~data) .cse6 .cse10) (= ~wl_pc 0) (and .cse7 .cse0 .cse2 .cse3 (<= ~c .cse9) .cse8 .cse4 .cse5 .cse6 (<= .cse9 ~c) .cse10)))) [2018-12-03 16:46:46,242 INFO L444 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse16 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse9 (<= ~data .cse16)) (.cse11 (<= .cse16 ~data)) (.cse0 (<= ~c_t .cse16)) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse16)) (.cse4 (<= .cse16 ~c_t)) (.cse15 (not (= ~r_st 0))) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse7 (<= .cse16 ~c)) (.cse13 (not (= ~wl_st 0))) (.cse14 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse8 .cse1 .cse10 .cse15 .cse6 .cse12) (and .cse14 .cse8 .cse1 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4 .cse15 .cse6 .cse12 .cse7 .cse13) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse14 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0))))) [2018-12-03 16:46:46,242 INFO L444 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse9 (= ~wb_st 0)) (.cse8 (= ~wl_pc 1))) (let ((.cse3 (not (= ~e_c 1))) (.cse4 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0))) (.cse7 (not (= ~wl_st 0))) (.cse1 (let ((.cse10 (= ~e_f 2)) (.cse11 (= ~c_req_up 0)) (.cse12 (= ~r_st 2)) (.cse13 (= ~c2_st 0)) (.cse14 (= ~e_g 2)) (.cse15 (= ~e_c 2)) (.cse16 (= ~e_e 2)) (.cse17 (= ~wl_st 2)) (.cse18 (= ~c 0)) (.cse19 (= ~d 0))) (or (and (= ~wl_pc 2) .cse10 .cse11 (= ~c2_pc 1) .cse12 .cse13 (= ~wb_pc 1) .cse14 .cse15 (= ~wb_st 2) (= (mod ~e_wl 2) 0) .cse16 .cse17 (= ~c1_pc 1) .cse18 .cse19) (and .cse10 .cse11 .cse9 .cse12 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~e_wl 0) .cse13 .cse8 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse2 (= ~t_b 0))) (or (and (= ~data 0) .cse0 (= ~processed 0) .cse1 .cse2) (and .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7) (and (and .cse8 .cse3 .cse4 .cse0 .cse5 .cse6) .cse7) (and (<= ~t_b ~data) .cse1 .cse9 (<= ~data ~t_b) .cse2)))) [2018-12-03 16:46:46,242 INFO L444 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse2 (<= ~c .cse4)) (.cse6 (<= .cse4 ~c)) (.cse0 (<= ~c_t .cse4)) (.cse12 (= ~wl_pc 2)) (.cse3 (<= .cse4 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse14 (<= ~data .cse4)) (.cse9 (not (= ~r_st 0))) (.cse15 (<= .cse4 ~data)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse10 (not (= ~e_c 0))) (.cse11 (not (= ~wl_st 0))) (.cse16 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~d .cse4) .cse5 .cse6 (<= .cse4 ~d) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse10 .cse11) (and (and .cse16 .cse7 .cse1 .cse8 .cse5 .cse10) .cse11) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse16 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0))))) [2018-12-03 16:46:46,242 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-12-03 16:46:46,243 INFO L444 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse3 (= ~wl_pc 1)) (.cse6 (= ~wb_st 0)) (.cse11 (= ~wl_pc 2)) (.cse1 (= ~wb_pc 0))) (let ((.cse4 (<= 1 ~c1_pc)) (.cse0 (let ((.cse12 (= ~c2_st 0)) (.cse13 (= ~e_g 2)) (.cse14 (= ~e_c 2)) (.cse15 (= ~e_f 2)) (.cse16 (= ~c_req_up 0)) (.cse17 (= ~e_e 2)) (.cse18 (= ~wl_st 2)) (.cse19 (= ~d 0))) (or (and .cse12 .cse13 .cse14 .cse11 .cse15 .cse16 (= (mod ~e_wl 2) 0) .cse17 .cse18 (= ~c2_pc 1) .cse19) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~c2_pc 0) .cse1 .cse19 (= ~e_wl 0))))) (.cse5 (<= 2 ~e_wl)) (.cse2 (let ((.cse8 (= ~c 0)) (.cse9 (= ~r_st 2)) (.cse10 (= ~t_b 0))) (or (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse1) (and (= ~wb_pc 1) .cse11 .cse6 .cse8 .cse9 .cse10))))) (or (and (<= ~t_b ~data) .cse0 (and (= ~c1_pc 0) .cse1) (<= ~data ~t_b) .cse2) (and (and .cse3 (not (= ~e_c 1)) .cse4 .cse5 .cse6 (<= 1 ~c2_pc) (not (= ~e_c 0))) (not (= ~wl_st 0))) (let ((.cse7 (+ ~t_b 1))) (and .cse4 .cse0 (<= ~data .cse7) .cse5 (= ~processed 0) .cse2 (<= .cse7 ~data)))))) [2018-12-03 16:46:46,243 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse3 .cse4)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 (not (= ~r_st 0)) .cse2 .cse3 .cse4))) [2018-12-03 16:46:46,243 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-12-03 16:46:46,243 INFO L444 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse1 (<= 1 ~c1_pc)) (.cse4 (<= 1 ~c2_pc)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 2 ~e_wl)) (.cse3 (not (= ~r_st 0))) (.cse5 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~e_c 0)) .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse1 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 (<= .cse7 ~c) .cse0 (<= ~data .cse7) .cse2 .cse3 (<= .cse7 ~data) .cse5)))) [2018-12-03 16:46:46,244 INFO L444 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse5 (+ ~t_b 2)) (.cse18 (= ~wl_pc 1)) (.cse19 (= ~wl_pc 2))) (let ((.cse14 (= ~c1_st 0)) (.cse15 (= ~c2_st 0)) (.cse16 (let ((.cse20 (= ~e_f 2)) (.cse21 (= ~c_req_up 0)) (.cse22 (= ~r_st 2)) (.cse23 (= ~e_g 2)) (.cse24 (= ~e_c 2)) (.cse25 (= ~e_e 2)) (.cse26 (= ~wl_st 2)) (.cse27 (= ~c 0)) (.cse28 (= ~d 0))) (or (and .cse20 .cse21 (= ~wb_st 0) .cse22 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~e_wl 0) .cse18 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse19 .cse20 .cse21 (= ~c2_pc 1) .cse22 (= ~wb_pc 1) .cse23 .cse24 (= ~wb_st 2) (= (mod ~e_wl 2) 0) .cse25 .cse26 (= ~c1_pc 1) .cse27 .cse28)))) (.cse17 (= ~t_b 0)) (.cse0 (<= ~c_t .cse5)) (.cse2 (<= ~c .cse5)) (.cse3 (<= .cse5 ~c_t)) (.cse4 (<= 1 ~processed)) (.cse7 (<= .cse5 ~c)) (.cse9 (<= ~data .cse5)) (.cse11 (<= .cse5 ~data)) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse13 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~d .cse5) .cse6 .cse7 (<= .cse5 ~d) .cse8 .cse9 .cse10 (not (= ~r_st 0)) .cse11 .cse12 .cse13) (and .cse14 (= ~data 0) .cse15 (= ~processed 0) .cse10 .cse16 .cse17) (and (<= ~t_b ~data) .cse14 (<= ~data ~t_b) .cse15 .cse18 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse18 .cse8 .cse1 .cse10 .cse6 .cse12) .cse13)))) [2018-12-03 16:46:46,244 INFO L444 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse34 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse10 (<= ~data .cse6)) (.cse13 (<= .cse6 ~data)) (.cse23 (<= ~t_b ~data)) (.cse32 (= ~t_b 0)) (.cse33 (= ~d 0)) (.cse27 (<= ~data ~t_b)) (.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse24 (= ~c_req_up 0)) (.cse25 (= ~c2_pc 1)) (.cse26 (= ~r_st 2)) (.cse16 (= ~wl_pc 1)) (.cse28 (= ~wb_pc 1)) (.cse29 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~wb_st 2)) (.cse30 (= ~c2_st 2)) (.cse21 (= ~e_e 2)) (.cse22 (= ~c1_pc 1)) (.cse31 (= ~c 0)) (.cse0 (<= ~c_t .cse6)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse12 (not (= ~r_st 0))) (.cse7 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0))) (.cse8 (<= .cse6 ~c)) (.cse15 (not .cse34))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse1 .cse11 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse18 (= ~e_wl 0) .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= ~wl_st 2) .cse31 .cse32 .cse33) (and .cse11 .cse23 (and .cse34 .cse32 .cse33) .cse27 (or (and .cse17 .cse24 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse26 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse29 .cse19 .cse21 .cse31) (and .cse17 .cse18 .cse24 .cse25 .cse26 .cse16 .cse28 .cse29 .cse19 .cse20 .cse30 (= (mod ~e_wl 2) 0) .cse21 .cse22 .cse31))) (and .cse0 .cse9 .cse1 .cse11 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse15)))) [2018-12-03 16:46:46,245 INFO L444 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse17 (+ ~t_b 2)) (.cse16 (= ~wl_pc 1)) (.cse2 (= ~wl_pc 2))) (let ((.cse13 (= ~wb_st 0)) (.cse14 (= ~t_b 0)) (.cse15 (let ((.cse18 (= ~e_f 2)) (.cse19 (= ~c1_st 2)) (.cse20 (= ~c_req_up 0)) (.cse21 (= ~c2_pc 1)) (.cse22 (= ~r_st 2)) (.cse23 (= ~e_g 2)) (.cse24 (= ~e_c 2)) (.cse25 (= ~c2_st 2)) (.cse26 (= ~e_e 2)) (.cse27 (= ~wl_st 2)) (.cse28 (= ~c1_pc 1)) (.cse29 (= ~c 0)) (.cse30 (= ~d 0))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 0) (= ~e_wl 0) .cse16 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse2 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 1) .cse23 .cse24 .cse25 (= (mod ~e_wl 2) 0) .cse26 .cse27 .cse28 .cse29 .cse30)))) (.cse0 (<= ~c_t .cse17)) (.cse3 (<= ~c .cse17)) (.cse4 (<= .cse17 ~c_t)) (.cse6 (<= .cse17 ~c)) (.cse8 (<= ~data .cse17)) (.cse10 (<= .cse17 ~data)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse11 (not (= ~e_c 0))) (.cse12 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse8 .cse9 (and .cse13 .cse14) .cse15 .cse10) (and (<= ~t_b ~data) .cse13 (<= ~data ~t_b) .cse16 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 (<= ~d .cse17) .cse5 .cse6 (<= .cse17 ~d) .cse7 .cse8 .cse9 (not (= ~r_st 0)) .cse10 .cse11 .cse12) (and (and .cse16 .cse7 .cse1 .cse9 .cse5 .cse11) .cse12)))) [2018-12-03 16:46:46,245 INFO L444 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse3 .cse1 (not (= ~r_st 0)) .cse2 .cse4 .cse5))) [2018-12-03 16:46:46,245 INFO L444 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse3 (<= 1 ~c2_pc)) (.cse1 (<= 2 ~e_wl)) (.cse2 (not (= ~r_st 0))) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (and (not (= ~e_c 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~e_f 2) (= ~c1_st 2) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (= (mod ~wl_st 2) 0) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0) .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse0 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse3 (<= .cse7 ~c) (<= ~data .cse7) .cse1 .cse2 (<= .cse7 ~data) .cse4 .cse5)) (= ~wl_pc 0))) [2018-12-03 16:46:46,246 INFO L444 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse5 (= ~wl_pc 1)) (.cse14 (= ~wb_pc 1))) (let ((.cse0 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0))) (.cse6 (<= 2 ~e_wl)) (.cse7 (let ((.cse15 (= ~e_f 2)) (.cse16 (= ~c1_st 2)) (.cse17 (= ~c_req_up 0)) (.cse18 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~e_e 2)) (.cse21 (= ~wl_st 2)) (.cse22 (= ~c1_pc 1)) (.cse23 (= ~d 0))) (or (and .cse15 .cse16 .cse17 (= ~c2_pc 0) (= ~e_wl 0) .cse5 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse16 .cse17 (= ~c2_pc 1) .cse14 .cse18 .cse19 (= (mod ~e_wl 2) 0) .cse20 .cse21 .cse22 .cse23)))) (.cse8 (let ((.cse10 (= ~wb_st 0)) (.cse11 (= ~c 0)) (.cse12 (= ~r_st 2)) (.cse13 (= ~t_b 0))) (or (and .cse5 .cse10 .cse11 .cse12 .cse13 (= ~wb_pc 0)) (and .cse14 (= ~wl_pc 2) .cse10 .cse11 .cse12 .cse13))))) (or (and (<= 1 ~processed) (and (and .cse0 .cse1 .cse2 .cse3) .cse4)) (and .cse5 .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse5 (<= ~t_b ~data) .cse7 (<= ~data ~t_b) .cse8) (let ((.cse9 (+ ~t_b 1))) (and (= ~processed 0) (<= ~data .cse9) .cse6 .cse7 .cse8 (<= .cse9 ~data)))))) [2018-12-03 16:46:46,299 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:46:46 BoogieIcfgContainer [2018-12-03 16:46:46,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:46:46,300 INFO L168 Benchmark]: Toolchain (without parser) took 44467.90 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:46:46,301 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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 16:46:46,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.68 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 16:46:46,302 INFO L168 Benchmark]: Boogie Preprocessor took 47.48 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 16:46:46,303 INFO L168 Benchmark]: RCFGBuilder took 731.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:46,303 INFO L168 Benchmark]: TraceAbstraction took 43628.29 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:46:46,307 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.15 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 56.68 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 47.48 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 731.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43628.29 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: 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: 296]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc)) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~wl_st == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && 2 <= ~e_wl) && !(~r_st == 0)) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc)) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~wl_st == 0)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((~wl_pc == 1 && ~t_b <= ~data) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) || (((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 2 <= ~data) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && 2 <= ~e_wl) && !(~r_st == 0)) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~t_b <= ~data && ~data <= ~t_b) && (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~t_b == 0) && ~d == 0)) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~c1_st == 0 && ~data == 0) && ~c2_st == 0) && ~processed == 0) && 2 <= ~e_wl) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0)) || ((((((~t_b <= ~data && ~c1_st == 0) && ~data <= ~t_b) && ~c2_st == 0) && ~wl_pc == 1) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((~t_b <= ~data && (((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~wl_pc == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 1) && ~d == 0) || ((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 0) && ~wb_pc == 0) && ~d == 0) && ~e_wl == 0))) && ~c1_pc == 0 && ~wb_pc == 0) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) || (((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((1 <= ~c1_pc && (((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~wl_pc == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 1) && ~d == 0) || ((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 0) && ~wb_pc == 0) && ~d == 0) && ~e_wl == 0))) && ~data <= ~t_b + 1) && 2 <= ~e_wl) && ~processed == 0) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((~data == 0 && 2 <= ~e_wl) && ~processed == 0) && ((((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0))) && ~t_b == 0) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~t_b <= ~data && ((((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0))) && ~wb_st == 0) && ~data <= ~t_b) && ~t_b == 0) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~t_b <= ~data && ~data <= ~t_b) && ~c2_st == 0) && 2 <= ~e_wl) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0) && !(~wl_st == 0))) || ((((((2 <= ~e_wl && ~t_b <= ~data) && ~e_wl % 2 == 0) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~data <= ~t_b) && ~t_b == 0) && !(~wl_st == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((((((~t_b <= ~data && ~c2_pc == 1) && ~data <= ~t_b) && ~wl_pc == 1) && ~wb_pc == 1) && 2 <= ~e_wl) && (((((((~e_g == 2 && ~e_c == 2) && ~e_f == 2) && ~wb_st == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~r_st == 2) && ~e_wl % 2 == 0) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0) && !(~wl_st == 0)) || (~wl_pc == 2 && (((((((~t_b + 2 <= ~d && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((~wl_pc == 1 && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((~t_b <= ~data && ~c2_pc == 1) && ~data <= ~t_b) && ~wl_pc == 1) && ~wb_pc == 1) && 2 <= ~e_wl) && (((((((~e_g == 2 && ~e_c == 2) && ~e_f == 2) && ~wb_st == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~r_st == 2) && ~e_wl % 2 == 0) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0))) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~t_b <= ~data && ~data <= ~t_b) && ~wl_pc == 1) && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0)))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ~t_b == 0) && ~t_b + 2 <= ~data) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0)))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0)))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ~wb_st == 0 && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b + 2 <= ~data)) || (((((~t_b <= ~data && ~wb_st == 0) && ~data <= ~t_b) && ~wl_pc == 1) && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0)))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((1 <= ~processed && (((!(~e_c == 1) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~wl_pc == 1 && ~t_b <= ~data) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0)))) || (((((~processed == 0 && ~data <= ~t_b + 1) && 2 <= ~e_wl) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~wl_st % 2 == 0) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) && !(~wl_st == 0))) || (((((~wl_pc == 1 && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~wl_pc == 1 && (((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~t_b <= ~data) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0)))) || (((((~data <= ~t_b + 1 && (((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && 2 <= ~e_wl) && ~processed == 0) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 43.4s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 18.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 999 SDtfs, 921 SDslu, 1440 SDs, 0 SdLazy, 1100 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 908 GetRequests, 816 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1321occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.953083009663306 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 6.2745098039215685 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1154 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 355 NumberOfFragments, 6957 HoareAnnotationTreeSize, 29 FomulaSimplifications, 28166 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7903 FormulaSimplificationTreeSizeReductionInter, 16.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1269 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1635 ConstructedInterpolants, 0 QuantifiedInterpolants, 303873 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1617 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 1982/2033 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...