java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:41:59,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:41:59,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:41:59,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:41:59,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:41:59,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:41:59,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:41:59,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:41:59,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:41:59,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:41:59,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:41:59,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:41:59,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:41:59,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:41:59,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:41:59,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:41:59,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:41:59,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:41:59,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:41:59,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:41:59,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:41:59,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:41:59,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:41:59,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:41:59,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:41:59,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:41:59,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:41:59,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:41:59,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:41:59,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:41:59,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:41:59,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:41:59,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:41:59,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:41:59,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:41:59,731 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:41:59,731 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:41:59,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:41:59,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:41:59,747 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:41:59,748 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:41:59,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:41:59,748 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:41:59,748 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:41:59,749 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:41:59,751 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:41:59,752 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:41:59,752 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:41:59,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:41:59,753 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:41:59,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:41:59,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:41:59,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:41:59,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:41:59,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:41:59,756 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:41:59,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:41:59,756 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:41:59,756 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:41:59,756 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:41:59,757 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:41:59,757 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:41:59,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:41:59,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:41:59,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:59,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:41:59,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:41:59,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:41:59,760 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:41:59,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:41:59,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:41:59,760 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:41:59,760 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:41:59,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:41:59,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:41:59,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:41:59,818 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:41:59,819 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:41:59,820 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.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-12-03 16:41:59,820 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl' [2018-12-03 16:41:59,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:41:59,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:41:59,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:59,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:41:59,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:41:59,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:59,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:41:59,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:41:59,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:41:59,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... [2018-12-03 16:41:59,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:41:59,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:41:59,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:41:59,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:41:59,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:00,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:00,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:00,643 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:00,643 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:00 BoogieIcfgContainer [2018-12-03 16:42:00,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:00,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:00,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:00,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:00,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:59" (1/2) ... [2018-12-03 16:42:00,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d5890e and model type pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:00, skipping insertion in model container [2018-12-03 16:42:00,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:00" (2/2) ... [2018-12-03 16:42:00,651 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-12-03 16:42:00,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:00,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:00,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:00,732 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:00,732 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:00,733 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:00,733 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:00,733 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:00,733 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:00,733 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:00,733 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 16:42:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:00,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:00,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:00,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 16:42:00,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:00,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:00,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:01,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:01,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:01,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:01,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:01,048 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 16:42:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:01,106 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 16:42:01,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:01,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:01,120 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:42:01,120 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:42:01,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:42:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 16:42:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:42:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 16:42:01,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 16:42:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:01,174 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 16:42:01,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 16:42:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:01,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:01,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:01,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:01,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 16:42:01,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:01,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:01,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:01,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:01,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:01,394 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 16:42:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:01,461 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 16:42:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:01,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:01,467 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:42:01,467 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:42:01,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:42:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 16:42:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:42:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 16:42:01,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 16:42:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:01,499 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 16:42:01,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 16:42:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:01,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:01,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:01,501 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:01,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 16:42:01,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:01,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:01,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:01,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:01,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:01,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:01,690 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 16:42:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:01,931 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 16:42:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:01,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 16:42:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:01,936 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:42:01,936 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:42:01,937 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 16:42:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:42:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 16:42:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:42:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 16:42:01,962 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 16:42:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:01,966 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 16:42:01,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 16:42:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:01,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:01,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:01,969 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:01,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 16:42:01,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:01,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:02,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:02,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:02,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:02,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:02,105 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 16:42:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:02,194 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 16:42:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:02,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:02,198 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:42:02,199 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:42:02,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 16:42:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:42:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:42:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:42:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 16:42:02,245 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 16:42:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:02,245 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 16:42:02,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 16:42:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:02,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:02,250 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:02,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:02,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 16:42:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:02,515 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:02,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:02,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:02,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:02,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:02,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:02,521 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 16:42:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:02,585 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 16:42:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:02,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:02,587 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:42:02,587 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:42:02,588 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 16:42:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:42:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 16:42:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:42:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 16:42:02,627 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 16:42:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:02,627 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 16:42:02,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 16:42:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:02,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:02,629 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:02,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:02,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 16:42:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:02,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:02,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:02,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:02,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:02,756 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 16:42:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:02,862 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 16:42:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:02,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:02,865 INFO L225 Difference]: With dead ends: 489 [2018-12-03 16:42:02,865 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:42:02,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:42:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 16:42:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:42:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 16:42:02,932 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 16:42:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:02,933 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 16:42:02,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 16:42:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:02,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:02,939 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:02,939 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:02,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 16:42:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:02,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,126 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:03,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:03,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:03,166 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 16:42:03,168 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 16:42:03,209 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:03,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:04,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:04,601 INFO L272 AbstractInterpreter]: Visited 20 different actions 143 times. Merged at 19 different actions 88 times. Widened at 9 different actions 14 times. Found 32 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:42:04,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:04,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:04,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:04,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:05,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:05,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:42:05,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:05,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:05,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:05,350 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-12-03 16:42:06,172 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:42:06,449 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 16:42:07,997 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:42:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:08,006 INFO L93 Difference]: Finished difference Result 737 states and 923 transitions. [2018-12-03 16:42:08,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:42:08,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 16:42:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:08,008 INFO L225 Difference]: With dead ends: 737 [2018-12-03 16:42:08,008 INFO L226 Difference]: Without dead ends: 265 [2018-12-03 16:42:08,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:42:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-12-03 16:42:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2018-12-03 16:42:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-03 16:42:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2018-12-03 16:42:08,064 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 26 [2018-12-03 16:42:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:08,064 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2018-12-03 16:42:08,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2018-12-03 16:42:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:42:08,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:08,067 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:08,068 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:08,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 2 times [2018-12-03 16:42:08,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:08,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 16:42:08,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:08,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:08,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:08,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:08,151 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. Second operand 3 states. [2018-12-03 16:42:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:08,163 INFO L93 Difference]: Finished difference Result 247 states and 286 transitions. [2018-12-03 16:42:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:08,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:42:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:08,163 INFO L225 Difference]: With dead ends: 247 [2018-12-03 16:42:08,164 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:08,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:08,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 16:42:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:08,166 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:08,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:08,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:08,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:08,479 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 16:42:08,612 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 16:42:09,000 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-03 16:42:09,123 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:42:09,275 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:42:09,410 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:42:09,763 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 16:42:09,920 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 16:42:10,138 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-03 16:42:10,389 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 16:42:10,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 387) no Hoare annotation was computed. [2018-12-03 16:42:10,393 INFO L444 ceAbstractionStarter]: At program point L320(lines 314 321) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,393 INFO L444 ceAbstractionStarter]: At program point L384(lines 253 384) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 16:42:10,393 INFO L444 ceAbstractionStarter]: At program point L285(lines 285 295) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 16:42:10,394 INFO L444 ceAbstractionStarter]: At program point L300(lines 294 301) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,394 INFO L444 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,394 INFO L444 ceAbstractionStarter]: At program point L354(lines 354 361) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 387) no Hoare annotation was computed. [2018-12-03 16:42:10,394 INFO L444 ceAbstractionStarter]: At program point L381(lines 381 385) the Hoare annotation is: false [2018-12-03 16:42:10,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 387) no Hoare annotation was computed. [2018-12-03 16:42:10,395 INFO L444 ceAbstractionStarter]: At program point L280(lines 271 281) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 16:42:10,395 INFO L444 ceAbstractionStarter]: At program point L375(lines 375 382) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= 1 ULTIMATE.start_check_~tmp~103) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 16:42:10,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 386) no Hoare annotation was computed. [2018-12-03 16:42:10,396 INFO L444 ceAbstractionStarter]: At program point L340(lines 334 341) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,396 INFO L444 ceAbstractionStarter]: At program point L305(lines 305 315) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5))) [2018-12-03 16:42:10,396 INFO L444 ceAbstractionStarter]: At program point L365(lines 360 366) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= 1 ULTIMATE.start_check_~tmp~103) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:10,397 INFO L444 ceAbstractionStarter]: At program point L260(lines 260 272) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 16:42:10,419 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:10 BoogieIcfgContainer [2018-12-03 16:42:10,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:10,420 INFO L168 Benchmark]: Toolchain (without parser) took 10531.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -174.4 MB). Peak memory consumption was 542.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:10,421 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:10,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:10,422 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:10,423 INFO L168 Benchmark]: RCFGBuilder took 678.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:10,424 INFO L168 Benchmark]: TraceAbstraction took 9774.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -206.1 MB). Peak memory consumption was 511.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:10,428 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.19 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 39.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.16 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 678.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9774.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -206.1 MB). Peak memory consumption was 511.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 386]: 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: 360]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~103) && 0 == ~nomsg + 1 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 1 <= check_~tmp~103) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((~mode3 == 256 * (~mode3 / 256) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((~mode3 == 256 * (~mode3 / 256) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 9.6s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 182 SDslu, 170 SDs, 0 SdLazy, 162 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 167 NumberOfFragments, 1153 HoareAnnotationTreeSize, 13 FomulaSimplifications, 7940 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 226 ConstructedInterpolants, 8 QuantifiedInterpolants, 23112 SizeOfPredicates, 1 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 112/132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...