java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:39:19,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:39:19,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:39:19,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:39:19,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:39:19,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:39:19,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:39:19,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:39:19,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:39:19,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:39:19,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:39:19,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:39:19,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:39:19,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:39:19,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:39:19,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:39:19,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:39:19,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:39:19,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:39:19,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:39:19,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:39:19,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:39:19,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:39:19,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:39:19,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:39:19,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:39:19,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:39:19,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:39:19,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:39:19,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:39:19,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:39:19,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:39:19,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:39:19,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:39:19,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:39:19,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:39:19,504 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:39:19,516 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:39:19,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:39:19,517 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:39:19,517 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:39:19,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:39:19,518 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:39:19,518 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:39:19,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:39:19,518 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:39:19,518 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:39:19,519 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:39:19,519 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:39:19,519 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:39:19,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:39:19,519 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:39:19,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:39:19,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:39:19,520 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:39:19,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:39:19,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:39:19,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:39:19,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:39:19,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:39:19,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:39:19,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:39:19,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:39:19,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:39:19,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:39:19,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:39:19,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:39:19,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:39:19,523 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:39:19,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:19,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:39:19,524 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:39:19,524 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:39:19,524 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:39:19,524 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:39:19,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:39:19,525 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:39:19,525 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:39:19,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:39:19,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:39:19,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:39:19,577 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:39:19,578 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:39:19,579 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.5.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 15:39:19,579 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 15:39:19,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:39:19,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:39:19,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:19,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:39:19,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:39:19,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:19,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:39:19,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:39:19,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:39:19,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... [2018-12-03 15:39:19,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:39:19,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:39:19,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:39:19,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:39:19,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:39:19,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:39:20,481 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:39:20,481 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:39:20,482 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:20 BoogieIcfgContainer [2018-12-03 15:39:20,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:39:20,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:39:20,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:39:20,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:39:20,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:19" (1/2) ... [2018-12-03 15:39:20,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c7b38f and model type pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:39:20, skipping insertion in model container [2018-12-03 15:39:20,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:20" (2/2) ... [2018-12-03 15:39:20,490 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 15:39:20,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:39:20,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:39:20,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:39:20,559 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:39:20,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:39:20,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:39:20,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:39:20,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:39:20,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:39:20,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:39:20,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:39:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 15:39:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:20,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:20,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:20,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:20,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 15:39:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:20,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:20,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:20,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:20,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:20,909 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 15:39:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:20,980 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 15:39:20,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:20,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:20,995 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:39:20,995 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:39:21,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:39:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 15:39:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:39:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 15:39:21,053 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 15:39:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:21,053 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 15:39:21,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 15:39:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:21,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:21,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:21,055 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:21,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 15:39:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:21,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:21,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:21,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:21,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,204 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 15:39:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:21,248 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 15:39:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:21,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:21,251 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:39:21,252 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:39:21,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:39:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 15:39:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:39:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 15:39:21,277 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 15:39:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:21,277 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 15:39:21,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 15:39:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:21,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:21,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:21,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:21,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 15:39:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:21,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:21,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:21,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:21,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,414 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 15:39:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:21,466 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 15:39:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:21,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:21,471 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:39:21,472 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:39:21,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:39:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 15:39:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:39:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 15:39:21,512 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 15:39:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:21,513 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 15:39:21,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 15:39:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:21,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:21,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:21,516 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:21,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:21,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-12-03 15:39:21,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:21,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:21,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:21,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:21,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,625 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 15:39:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:21,708 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2018-12-03 15:39:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:21,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:21,711 INFO L225 Difference]: With dead ends: 289 [2018-12-03 15:39:21,711 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:39:21,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:39:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-12-03 15:39:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 15:39:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2018-12-03 15:39:21,774 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 16 [2018-12-03 15:39:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:21,774 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2018-12-03 15:39:21,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2018-12-03 15:39:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:21,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:21,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:21,777 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:21,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-12-03 15:39:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:21,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:22,072 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:22,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:22,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:39:22,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:22,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:39:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:39:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:39:22,076 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand 4 states. [2018-12-03 15:39:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:22,254 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2018-12-03 15:39:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:22,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 15:39:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:22,257 INFO L225 Difference]: With dead ends: 314 [2018-12-03 15:39:22,258 INFO L226 Difference]: Without dead ends: 312 [2018-12-03 15:39:22,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:39:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-03 15:39:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 189. [2018-12-03 15:39:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:39:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-03 15:39:22,325 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-12-03 15:39:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:22,325 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-03 15:39:22,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:39:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-03 15:39:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:22,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:22,331 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] [2018-12-03 15:39:22,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:22,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash 728287857, now seen corresponding path program 1 times [2018-12-03 15:39:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:22,603 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:22,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:22,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:22,609 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-03 15:39:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:22,735 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-12-03 15:39:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:22,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:39:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:22,740 INFO L225 Difference]: With dead ends: 561 [2018-12-03 15:39:22,740 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 15:39:22,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 15:39:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-12-03 15:39:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 15:39:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 15:39:22,831 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-12-03 15:39:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:22,832 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 15:39:22,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 15:39:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:22,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:22,835 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] [2018-12-03 15:39:22,835 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:22,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 470122419, now seen corresponding path program 1 times [2018-12-03 15:39:22,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:23,170 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:23,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:23,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:23,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:23,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:23,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:23,177 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 15:39:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:23,370 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 15:39:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:23,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:39:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:23,380 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 15:39:23,381 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 15:39:23,389 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 15:39:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 15:39:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 15:39:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 15:39:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 15:39:23,521 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 15:39:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:23,522 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 15:39:23,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 15:39:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:23,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:23,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:23,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:23,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1279469045, now seen corresponding path program 1 times [2018-12-03 15:39:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:23,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:23,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:23,913 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 15:39:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:23,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:23,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:23,939 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 15:39:23,941 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] [2018-12-03 15:39:23,987 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:39:23,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:39:25,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:39:25,507 INFO L272 AbstractInterpreter]: Visited 23 different actions 147 times. Merged at 22 different actions 92 times. Widened at 10 different actions 20 times. Found 32 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:39:25,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:25,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:39:25,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:25,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:25,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:25,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:25,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:25,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 15:39:26,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:39:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:39:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:39:26,265 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 15:39:27,035 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 15:39:27,287 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 15:39:28,117 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 15:39:28,671 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 15:39:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:29,975 INFO L93 Difference]: Finished difference Result 1735 states and 2175 transitions. [2018-12-03 15:39:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:39:29,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 15:39:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:29,985 INFO L225 Difference]: With dead ends: 1735 [2018-12-03 15:39:29,985 INFO L226 Difference]: Without dead ends: 679 [2018-12-03 15:39:29,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:39:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-12-03 15:39:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 609. [2018-12-03 15:39:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-12-03 15:39:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 713 transitions. [2018-12-03 15:39:30,104 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 713 transitions. Word has length 30 [2018-12-03 15:39:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:30,104 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 713 transitions. [2018-12-03 15:39:30,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:39:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 713 transitions. [2018-12-03 15:39:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:39:30,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:30,106 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:39:30,107 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1017459345, now seen corresponding path program 2 times [2018-12-03 15:39:30,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:30,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 15:39:30,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:30,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:30,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:30,197 INFO L87 Difference]: Start difference. First operand 609 states and 713 transitions. Second operand 3 states. [2018-12-03 15:39:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:30,215 INFO L93 Difference]: Finished difference Result 619 states and 724 transitions. [2018-12-03 15:39:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:30,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 15:39:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:30,216 INFO L225 Difference]: With dead ends: 619 [2018-12-03 15:39:30,216 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:39:30,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:39:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:39:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:39:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:39:30,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 15:39:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:30,218 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:39:30,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:39:30,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:39:30,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:39:30,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,345 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 60 [2018-12-03 15:39:30,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:30,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:31,609 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-03 15:39:31,863 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-03 15:39:31,982 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 15:39:32,122 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-03 15:39:32,384 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-03 15:39:32,671 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 15:39:34,399 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-03 15:39:35,294 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 15:39:35,407 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 15:39:35,538 INFO L444 ceAbstractionStarter]: At program point L353(lines 347 354) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,538 INFO L444 ceAbstractionStarter]: At program point L465(lines 310 465) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,539 INFO L444 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (= 0 ~st4) (<= (div ~mode4 256) 0) (= 0 ~st3) (<= ~send3 127) (<= 1 ~mode4) (= 0 ~st5) (<= ~r1 1) (= 0 ~st1) (= 0 (+ ~nomsg 1)) (= 0 ~st2) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 15:39:35,539 INFO L444 ceAbstractionStarter]: At program point L333(lines 327 334) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,539 INFO L444 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,540 INFO L444 ceAbstractionStarter]: At program point L453(lines 453 460) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~128) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 15:39:35,540 INFO L444 ceAbstractionStarter]: At program point L416(lines 410 417) the Hoare annotation is: (let ((.cse0 (= 0 ~st3)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (= 0 ~st4)) (.cse6 (<= (div ~mode4 256) 0)) (.cse7 (= 0 ~st5)) (.cse8 (not (= ~p3_new ~nomsg))) (.cse9 (= 0 ~st1)) (.cse10 (= 0 ~st2))) (or (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 (not (= ~p3_old ~nomsg)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~r1 0) .cse7 .cse8 .cse9 .cse10))) [2018-12-03 15:39:35,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 468) no Hoare annotation was computed. [2018-12-03 15:39:35,540 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 328) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 468) no Hoare annotation was computed. [2018-12-03 15:39:35,540 INFO L444 ceAbstractionStarter]: At program point L338(lines 338 348) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= 0 ~st3) .cse0 .cse1 (= ~mode4 (* 256 .cse2)) .cse3 (= ~mode5 (* 256 (div ~mode5 256))) (= 0 ~st4) (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 ~st5) (= 0 ~st1) (= 0 ~st2)) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L396(lines 390 397) the Hoare annotation is: (let ((.cse0 (= 0 ~st3)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (= 0 ~st4)) (.cse6 (<= (div ~mode4 256) 0)) (.cse7 (= 0 ~st5)) (.cse8 (not (= ~p3_new ~nomsg))) (.cse9 (= 0 ~st1)) (.cse10 (= 0 ~st2))) (or (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 (not (= ~p3_old ~nomsg)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse7 .cse8 .cse9 .cse10))) [2018-12-03 15:39:35,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 468) no Hoare annotation was computed. [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L376(lines 367 377) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse5 (= 0 ~st4)) (.cse0 (= 0 ~st3)) (.cse6 (= 0 ~st5)) (.cse8 (= 0 ~st1)) (.cse9 (= 0 ~st2)) (.cse11 (<= .cse3 0)) (.cse1 (<= ~send3 127)) (.cse12 (<= 1 ~mode4)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4 .cse5 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse6 (<= ~r1 1) .cse7 .cse8 .cse2 .cse9 .cse4 .cse10) (and .cse11 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse12 .cse2 .cse4 .cse10) (and .cse11 .cse1 .cse12 .cse7 .cse2 .cse4 .cse10)))) [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L401(lines 401 411) the Hoare annotation is: (let ((.cse0 (= 0 ~st3)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (= 0 ~st4)) (.cse6 (<= (div ~mode4 256) 0)) (.cse7 (= 0 ~st5)) (.cse8 (not (= ~p3_new ~nomsg))) (.cse9 (= 0 ~st1)) (.cse10 (= 0 ~st2))) (or (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 (not (= ~p3_old ~nomsg)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse7 .cse8 .cse9 .cse10))) [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L459(lines 459 466) the Hoare annotation is: false [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L381(lines 381 391) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse5 (= 0 ~st4)) (.cse0 (= 0 ~st3)) (.cse6 (= 0 ~st5)) (.cse8 (= 0 ~st1)) (.cse9 (= 0 ~st2)) (.cse11 (<= .cse3 0)) (.cse1 (<= ~send3 127)) (.cse12 (<= 1 ~mode4)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4 .cse5 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse6 (<= ~r1 1) .cse7 .cse8 .cse2 .cse9 .cse4 .cse10) (and .cse11 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse12 .cse2 .cse4 .cse10) (and .cse11 .cse1 .cse12 .cse7 .cse2 .cse4 .cse10)))) [2018-12-03 15:39:35,541 INFO L444 ceAbstractionStarter]: At program point L443(lines 438 444) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 15:39:35,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 467) no Hoare annotation was computed. [2018-12-03 15:39:35,562 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:39:35 BoogieIcfgContainer [2018-12-03 15:39:35,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:39:35,563 INFO L168 Benchmark]: Toolchain (without parser) took 15890.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -659.5 MB). Peak memory consumption was 606.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:35,564 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 15:39:35,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:35,565 INFO L168 Benchmark]: Boogie Preprocessor took 60.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:35,566 INFO L168 Benchmark]: RCFGBuilder took 685.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:35,567 INFO L168 Benchmark]: TraceAbstraction took 15079.34 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.8 MB). Peak memory consumption was 563.8 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:35,571 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 59.69 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 60.80 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 685.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15079.34 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.8 MB). Peak memory consumption was 563.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 467]: 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: 367]: Loop Invariant Derived loop invariant: (((((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && 0 == ~st4) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) || ((((((((((0 == ~st4 && 0 == ~st3) && ~send3 <= 127) && 0 == ~st5) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~nomsg + 1) && 0 == ~st2) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && 0 == ~st4) && ~mode4 / 256 <= 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) || ((((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 == ~st4) && ~mode4 / 256 <= 0) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && 0 == ~st4) && ~mode4 / 256 <= 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) || (((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 == ~st4) && ~mode4 / 256 <= 0) && ~r1 == 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: (((((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && 0 == ~st4) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) || ((((((((((0 == ~st4 && 0 == ~st3) && ~send3 <= 127) && 0 == ~st5) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~nomsg + 1) && 0 == ~st2) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && 0 == ~st4) && ~mode4 / 256 <= 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) || ((((((((((((0 == ~st3 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 == ~st4) && ~mode4 / 256 <= 0) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && 0 == ~st5) && !(~p3_new == ~nomsg)) && 0 == ~st1) && 0 == ~st2) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((((((0 == ~st3 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 == ~st4) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~st5) && 0 == ~st1) && 0 == ~st2) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((0 == ~st4 && ~mode4 / 256 <= 0) && 0 == ~st3) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~st5) && ~r1 <= 1) && 0 == ~st1) && 0 == ~nomsg + 1) && 0 == ~st2) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~128) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 14.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 265 SDtfs, 237 SDslu, 221 SDs, 0 SdLazy, 176 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 345 NumberOfFragments, 1148 HoareAnnotationTreeSize, 15 FomulaSimplifications, 21606 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 15 FomulaSimplificationsInter, 417 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 50304 SizeOfPredicates, 13 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 126/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...