java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:56:36,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:56:36,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:56:36,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:56:36,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:56:36,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:56:36,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:56:36,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:56:36,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:56:36,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:56:36,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:56:36,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:56:36,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:56:36,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:56:36,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:56:36,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:56:36,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:56:36,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:56:36,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:56:36,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:56:36,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:56:36,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:56:36,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:56:36,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:56:36,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:56:36,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:56:36,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:56:36,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:56:36,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:56:36,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:56:36,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:56:36,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:56:36,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:56:36,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:56:36,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:56:36,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:56:36,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:56:36,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:56:36,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:56:36,470 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:56:36,470 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:56:36,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:56:36,470 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:56:36,470 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:56:36,471 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:56:36,471 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:56:36,471 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:56:36,471 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:56:36,471 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:56:36,471 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:56:36,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:56:36,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:56:36,472 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:56:36,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:56:36,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:56:36,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:56:36,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:56:36,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:56:36,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:56:36,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:56:36,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:56:36,474 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:56:36,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:56:36,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:56:36,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:56:36,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:56:36,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:56:36,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:56:36,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:56:36,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:56:36,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:56:36,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:56:36,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:56:36,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:56:36,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:56:36,477 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:56:36,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:56:36,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:56:36,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:56:36,529 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:56:36,530 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:56:36,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 17:56:36,531 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-12-03 17:56:36,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:56:36,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:56:36,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:36,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:56:36,613 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:56:36,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:36,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:56:36,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:56:36,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:56:36,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... [2018-12-03 17:56:36,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:56:36,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:56:36,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:56:36,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:56:36,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:56:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:56:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:56:37,608 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:56:37,609 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:56:37,609 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:37 BoogieIcfgContainer [2018-12-03 17:56:37,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:56:37,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:56:37,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:56:37,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:56:37,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:36" (1/2) ... [2018-12-03 17:56:37,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac8aca and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:56:37, skipping insertion in model container [2018-12-03 17:56:37,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:37" (2/2) ... [2018-12-03 17:56:37,618 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 17:56:37,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:56:37,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:56:37,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:56:37,692 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:56:37,692 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:56:37,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:56:37,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:56:37,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:56:37,693 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:56:37,693 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:56:37,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:56:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 17:56:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:37,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:37,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:37,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:37,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 17:56:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:37,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:37,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:37,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:37,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:38,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:38,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:38,021 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 17:56:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:38,073 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 17:56:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:38,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:38,087 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:56:38,088 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:56:38,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:56:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 17:56:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:56:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 17:56:38,135 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 17:56:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:38,135 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 17:56:38,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 17:56:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:38,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:38,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:38,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:38,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 17:56:38,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:38,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:38,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:38,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:38,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:38,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:38,314 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 17:56:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:38,370 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 17:56:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:38,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:38,373 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:56:38,373 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:56:38,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:56:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 17:56:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:56:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 17:56:38,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 17:56:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 17:56:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 17:56:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:38,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:38,397 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:38,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 17:56:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:38,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:38,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:38,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:38,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:38,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:38,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:56:38,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:38,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:56:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:56:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:56:38,604 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 17:56:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:38,937 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 17:56:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:56:38,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 17:56:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:38,944 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:56:38,944 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:56:38,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:56:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:56:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 17:56:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:56:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 17:56:38,996 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 17:56:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:38,999 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 17:56:39,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:56:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 17:56:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:39,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:39,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:39,001 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 17:56:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:39,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:39,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:39,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:39,110 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 17:56:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:39,196 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 17:56:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:39,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:39,198 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:56:39,198 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:56:39,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:56:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:56:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:56:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 17:56:39,232 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 17:56:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:39,233 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 17:56:39,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 17:56:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:39,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:39,237 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:39,237 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:39,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 17:56:39,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:39,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:39,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:39,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:39,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:39,459 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 17:56:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:39,545 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 17:56:39,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:39,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:39,553 INFO L225 Difference]: With dead ends: 321 [2018-12-03 17:56:39,553 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 17:56:39,554 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 17:56:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 17:56:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 17:56:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:56:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 17:56:39,637 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 17:56:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:39,638 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 17:56:39,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 17:56:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:39,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:39,642 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:39,642 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:39,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 17:56:39,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:39,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:40,006 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:40,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:40,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:40,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:40,016 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 17:56:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:40,160 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 17:56:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:40,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:40,164 INFO L225 Difference]: With dead ends: 633 [2018-12-03 17:56:40,164 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:56:40,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:56:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 17:56:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 17:56:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 17:56:40,252 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 17:56:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:40,253 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 17:56:40,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 17:56:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:40,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:40,259 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:40,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:40,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 17:56:40,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:40,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:40,585 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:40,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:40,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:40,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:40,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:40,592 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 17:56:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:40,789 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 17:56:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:40,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:40,794 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 17:56:40,795 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 17:56:40,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 17:56:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 17:56:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 17:56:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 17:56:40,926 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 17:56:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:40,926 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 17:56:40,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 17:56:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:40,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:40,929 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 17:56:40,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:40,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 17:56:40,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:40,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:40,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:41,266 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:41,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:41,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:41,272 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 17:56:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:41,594 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 17:56:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:41,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:41,603 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 17:56:41,603 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 17:56:41,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 17:56:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 17:56:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 17:56:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 17:56:41,849 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 17:56:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:41,850 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 17:56:41,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 17:56:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:41,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:41,854 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:41,856 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:41,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 17:56:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:41,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:41,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:41,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:42,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:42,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:56:42,071 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 17:56:42,073 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 17:56:42,141 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:56:42,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:56:44,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:58:06,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:58:06,901 INFO L272 AbstractInterpreter]: Visited 26 different actions 357 times. Merged at 25 different actions 258 times. Widened at 16 different actions 23 times. Found 72 fixpoints after 18 different actions. Largest state had 0 variables. [2018-12-03 17:58:06,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:06,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:58:06,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:06,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:58:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:06,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:58:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:07,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:58:07,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:58:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:58:07,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:07,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:58:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:58:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:58:07,705 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-12-03 17:58:07,938 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:58:09,018 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 17:58:09,429 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:58:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:11,393 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-12-03 17:58:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:58:11,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-03 17:58:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:11,409 INFO L225 Difference]: With dead ends: 4801 [2018-12-03 17:58:11,409 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 17:58:11,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:58:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 17:58:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 17:58:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 17:58:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 17:58:11,840 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-12-03 17:58:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:11,840 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 17:58:11,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:58:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 17:58:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:11,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:11,846 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:58:11,847 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:11,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-12-03 17:58:11,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:11,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:11,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:12,110 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:58:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:58:12,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:12,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:58:12,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:12,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:12,118 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 17:58:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:12,545 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 17:58:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:12,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:58:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:12,558 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 17:58:12,558 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 17:58:12,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 17:58:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 17:58:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 17:58:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 17:58:12,895 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 17:58:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:12,895 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 17:58:12,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 17:58:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:12,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:12,898 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:58:12,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:12,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 17:58:12,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:12,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:58:12,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:12,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 17:58:12,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:12,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:12,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:12,962 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 17:58:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:13,000 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 17:58:13,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:13,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:58:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:13,000 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 17:58:13,000 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:58:13,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:58:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:58:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:58:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:58:13,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 17:58:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:13,004 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:58:13,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:58:13,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:58:13,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:58:13,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,158 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 17:58:13,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,460 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 17:58:13,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,622 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 17:58:13,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:13,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,207 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 17:58:14,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:14,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:15,501 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 17:58:16,796 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:17,172 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:17,329 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:17,485 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:58:17,621 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:17,919 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:18,054 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:18,258 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:18,420 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 17:58:18,621 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:58:18,626 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:58:18,626 INFO L444 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:58:18,626 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-12-03 17:58:18,626 INFO L444 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,627 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:58:18,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:58:18,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:58:18,627 INFO L444 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-12-03 17:58:18,628 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:58:18,628 INFO L444 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,628 INFO L444 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 17:58:18,628 INFO L444 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:58:18,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-12-03 17:58:18,629 INFO L444 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,629 INFO L444 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 17:58:18,629 INFO L444 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,629 INFO L444 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse7 .cse6))) [2018-12-03 17:58:18,629 INFO L444 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,630 INFO L444 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 17:58:18,630 INFO L444 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,630 INFO L444 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 17:58:18,683 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:58:18 BoogieIcfgContainer [2018-12-03 17:58:18,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:58:18,685 INFO L168 Benchmark]: Toolchain (without parser) took 102076.23 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:58:18,686 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 17:58:18,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.70 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 17:58:18,687 INFO L168 Benchmark]: Boogie Preprocessor took 73.05 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 17:58:18,687 INFO L168 Benchmark]: RCFGBuilder took 865.31 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:58:18,688 INFO L168 Benchmark]: TraceAbstraction took 101072.84 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:58:18,692 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 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 57.70 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 73.05 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 865.31 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101072.84 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 100.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 84.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1388 HoareAnnotationTreeSize, 17 FomulaSimplifications, 81143 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 429 ConstructedInterpolants, 12 QuantifiedInterpolants, 63939 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 274/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...