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.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:43:15,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:43:15,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:43:15,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:43:15,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:43:15,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:43:15,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:43:15,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:43:15,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:43:15,136 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:43:15,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:43:15,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:43:15,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:43:15,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:43:15,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:43:15,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:43:15,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:43:15,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:43:15,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:43:15,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:43:15,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:43:15,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:43:15,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:43:15,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:43:15,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:43:15,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:43:15,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:43:15,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:43:15,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:43:15,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:43:15,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:43:15,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:43:15,161 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:43:15,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:43:15,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:43:15,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:43:15,164 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:43:15,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:43:15,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:43:15,178 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:43:15,178 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:43:15,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:43:15,179 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:43:15,179 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:43:15,179 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:43:15,179 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:43:15,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:43:15,180 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:43:15,180 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:43:15,181 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:43:15,181 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:43:15,181 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:43:15,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:43:15,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:43:15,182 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:43:15,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:43:15,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:43:15,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:43:15,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:43:15,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:43:15,184 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:43:15,184 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:43:15,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:43:15,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:43:15,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:43:15,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:43:15,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:43:15,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:43:15,186 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:43:15,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:43:15,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:43:15,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:43:15,187 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:43:15,187 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:43:15,187 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:43:15,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:43:15,188 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:43:15,188 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:43:15,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:43:15,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:43:15,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:43:15,235 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:43:15,236 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:43:15,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 16:43:15,237 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl' [2018-12-03 16:43:15,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:43:15,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:43:15,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:15,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:43:15,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:43:15,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:15,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:43:15,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:43:15,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:43:15,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/1) ... [2018-12-03 16:43:15,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:43:15,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:43:15,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:43:15,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:43:15,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (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:43:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:43:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:43:16,066 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:43:16,066 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:43:16,067 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:16 BoogieIcfgContainer [2018-12-03 16:43:16,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:43:16,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:43:16,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:43:16,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:43:16,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:15" (1/2) ... [2018-12-03 16:43:16,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559d6e84 and model type pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:16, skipping insertion in model container [2018-12-03 16:43:16,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:16" (2/2) ... [2018-12-03 16:43:16,075 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 16:43:16,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:43:16,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:43:16,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:43:16,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:43:16,145 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:43:16,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:43:16,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:43:16,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:43:16,145 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:43:16,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:43:16,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:43:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 16:43:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:16,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:16,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:16,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:16,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 16:43:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:16,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:16,416 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:43:16,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:16,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:16,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:16,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:16,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:16,437 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 16:43:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:16,480 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 16:43:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:16,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:16,494 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:43:16,494 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:43:16,499 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:43:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:43:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 16:43:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:43:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 16:43:16,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 16:43:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:16,542 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 16:43:16,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 16:43:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:16,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:16,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:16,544 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:16,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 16:43:16,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:16,693 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:43:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:16,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:16,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:16,701 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 16:43:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:16,771 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 16:43:16,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:16,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:16,775 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:43:16,775 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:43:16,777 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:43:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:43:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 16:43:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:43:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 16:43:16,810 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 16:43:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:16,810 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 16:43:16,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 16:43:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:16,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:16,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:16,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:16,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 16:43:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:16,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:16,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:16,905 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:43:16,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:16,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:16,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:16,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:16,907 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 16:43:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:16,971 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 16:43:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:16,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:16,976 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:43:16,977 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:43:16,978 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:43:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:43:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 16:43:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:43:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 16:43:17,001 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 16:43:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:17,002 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 16:43:17,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 16:43:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:17,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:17,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:17,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:17,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 16:43:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:17,133 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:43:17,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:17,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:17,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:17,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:17,135 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 16:43:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:17,244 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 16:43:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:17,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:17,247 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:43:17,248 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:43:17,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:43:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:43:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 16:43:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:43:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 16:43:17,293 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 16:43:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:17,295 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 16:43:17,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 16:43:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:17,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:17,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:17,298 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:17,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 16:43:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:17,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:17,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:43:17,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:17,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:17,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:17,490 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 16:43:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:17,697 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 16:43:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:17,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 16:43:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:17,701 INFO L225 Difference]: With dead ends: 293 [2018-12-03 16:43:17,701 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:43:17,702 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:43:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:43:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 16:43:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:43:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 16:43:17,766 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 16:43:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:17,769 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 16:43:17,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 16:43:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:17,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:17,771 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] [2018-12-03 16:43:17,772 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:17,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 16:43:17,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:17,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:17,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:17,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:17,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:17,949 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 16:43:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:18,053 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 16:43:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:18,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 16:43:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:18,056 INFO L225 Difference]: With dead ends: 525 [2018-12-03 16:43:18,056 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:43:18,058 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:43:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:43:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 16:43:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 16:43:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 16:43:18,120 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 16:43:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:18,121 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 16:43:18,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 16:43:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:18,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:18,124 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, 1, 1] [2018-12-03 16:43:18,124 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:18,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 16:43:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:18,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:18,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:43:18,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:18,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:18,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 16:43:18,301 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [44], [46], [48], [52], [54], [56] [2018-12-03 16:43:18,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:43:18,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:43:19,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:43:19,361 INFO L272 AbstractInterpreter]: Visited 22 different actions 97 times. Merged at 19 different actions 51 times. Widened at 1 different actions 1 times. Found 20 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 16:43:19,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:19,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:43:19,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:19,387 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:43:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:19,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:19,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:43:19,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:43:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:19,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:43:19,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:19,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:43:19,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:43:19,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:43:19,934 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-12-03 16:43:20,590 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 16:43:21,130 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:43:21,575 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:43:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:22,449 INFO L93 Difference]: Finished difference Result 827 states and 1068 transitions. [2018-12-03 16:43:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:43:22,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-03 16:43:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:22,453 INFO L225 Difference]: With dead ends: 827 [2018-12-03 16:43:22,453 INFO L226 Difference]: Without dead ends: 481 [2018-12-03 16:43:22,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:43:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-12-03 16:43:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 307. [2018-12-03 16:43:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-03 16:43:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2018-12-03 16:43:22,532 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 28 [2018-12-03 16:43:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:22,532 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2018-12-03 16:43:22,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:43:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2018-12-03 16:43:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:43:22,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:22,536 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:22,536 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:22,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2104861015, now seen corresponding path program 2 times [2018-12-03 16:43:22,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:22,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 16:43:22,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:22,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:22,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:22,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:22,696 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand 3 states. [2018-12-03 16:43:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:22,739 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2018-12-03 16:43:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:22,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:43:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:22,741 INFO L225 Difference]: With dead ends: 357 [2018-12-03 16:43:22,741 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:22,742 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:43:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:22,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 16:43:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:22,743 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:22,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:22,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:22,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:22,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:23,381 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-03 16:43:24,168 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-12-03 16:43:24,320 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:43:24,526 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-03 16:43:24,680 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-03 16:43:25,102 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-12-03 16:43:25,407 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:43:25,579 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-03 16:43:25,583 INFO L444 ceAbstractionStarter]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= .cse3 0)) (.cse6 (<= 1 ~mode4)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and .cse5 .cse6 .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse4 .cse7)))) [2018-12-03 16:43:25,584 INFO L444 ceAbstractionStarter]: At program point L349(lines 344 350) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ~mode4) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~85) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:25,584 INFO L444 ceAbstractionStarter]: At program point L271(lines 263 272) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= .cse3 0)) (.cse6 (<= 1 ~mode4)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and .cse5 .cse6 .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse4 .cse7)))) [2018-12-03 16:43:25,584 INFO L444 ceAbstractionStarter]: At program point L329(lines 329 335) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ~mode4) (<= ~send3 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:25,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 371) no Hoare annotation was computed. [2018-12-03 16:43:25,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 371) no Hoare annotation was computed. [2018-12-03 16:43:25,584 INFO L444 ceAbstractionStarter]: At program point L276(lines 276 286) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= .cse3 0)) (.cse6 (<= 1 ~mode4)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and .cse5 .cse6 .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse4 .cse7)))) [2018-12-03 16:43:25,585 INFO L444 ceAbstractionStarter]: At program point L338(lines 334 345) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ~mode4) (<= ~send3 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:25,585 INFO L444 ceAbstractionStarter]: At program point L231(lines 231 242) the Hoare annotation is: (let ((.cse3 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and (<= .cse3 0) (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:25,585 INFO L444 ceAbstractionStarter]: At program point L359(lines 359 366) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ~mode4) (<= ~send3 127) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:43:25,585 INFO L444 ceAbstractionStarter]: At program point L293(lines 285 294) the Hoare annotation is: (let ((.cse12 (div ~mode4 256))) (let ((.cse3 (not (= ~p3_new ~nomsg))) (.cse1 (= ULTIMATE.start_assert_~arg 1)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse8 (<= .cse12 0)) (.cse10 (<= 1 ~mode4)) (.cse13 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse0 (<= ~send3 127)) (.cse9 (exists ((v_~r1_9 Int)) (let ((.cse14 (mod v_~r1_9 256))) (and (= (+ .cse14 1) ~r1) (<= .cse14 0))))) (.cse11 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse5 (= ~mode4 (* 256 .cse12)) .cse6) (and .cse8 .cse0 .cse13 .cse1 .cse10 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse10 .cse13 .cse0 .cse9 .cse11 .cse4 .cse6 .cse7)))) [2018-12-03 16:43:25,585 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 371) no Hoare annotation was computed. [2018-12-03 16:43:25,586 INFO L444 ceAbstractionStarter]: At program point L368(lines 224 368) the Hoare annotation is: (let ((.cse3 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and (<= .cse3 0) (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:43:25,586 INFO L444 ceAbstractionStarter]: At program point L298(lines 298 309) the Hoare annotation is: (let ((.cse12 (div ~mode4 256))) (let ((.cse3 (not (= ~p3_new ~nomsg))) (.cse1 (= ULTIMATE.start_assert_~arg 1)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse8 (<= .cse12 0)) (.cse10 (<= 1 ~mode4)) (.cse13 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse0 (<= ~send3 127)) (.cse9 (exists ((v_~r1_9 Int)) (let ((.cse14 (mod v_~r1_9 256))) (and (= (+ .cse14 1) ~r1) (<= .cse14 0))))) (.cse11 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse5 (= ~mode4 (* 256 .cse12)) .cse6) (and .cse8 .cse0 .cse13 .cse1 .cse10 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse10 .cse13 .cse0 .cse9 .cse11 .cse4 .cse6 .cse7)))) [2018-12-03 16:43:25,586 INFO L444 ceAbstractionStarter]: At program point L315(lines 308 316) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ~mode4) (<= ~send3 127) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 16:43:25,586 INFO L444 ceAbstractionStarter]: At program point L249(lines 241 250) the Hoare annotation is: (let ((.cse3 (div ~mode4 256))) (let ((.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= .cse3 0)) (.cse6 (<= 1 ~mode4)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse7 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 .cse3)) .cse4) (and .cse5 .cse6 .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse4 .cse7)))) [2018-12-03 16:43:25,586 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 370) no Hoare annotation was computed. [2018-12-03 16:43:25,587 INFO L444 ceAbstractionStarter]: At program point L365(lines 365 369) the Hoare annotation is: false [2018-12-03 16:43:25,609 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:25 BoogieIcfgContainer [2018-12-03 16:43:25,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:25,611 INFO L168 Benchmark]: Toolchain (without parser) took 10311.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -196.2 MB). Peak memory consumption was 512.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:25,612 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:43:25,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.66 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:43:25,613 INFO L168 Benchmark]: Boogie Preprocessor took 33.86 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:43:25,614 INFO L168 Benchmark]: RCFGBuilder took 691.48 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 16:43:25,614 INFO L168 Benchmark]: TraceAbstraction took 9541.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -238.5 MB). Peak memory consumption was 470.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:25,619 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.66 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 33.86 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 691.48 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 9541.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -238.5 MB). Peak memory consumption was 470.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: 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: 263]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && 1 <= ~mode4) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 179 SDslu, 174 SDs, 0 SdLazy, 208 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 72 NumberOfFragments, 1203 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4912 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 741 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 231 ConstructedInterpolants, 8 QuantifiedInterpolants, 28794 SizeOfPredicates, 1 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 106/130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...