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.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:43:09,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:43:09,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:43:09,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:43:09,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:43:09,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:43:09,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:43:09,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:43:09,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:43:09,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:43:09,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:43:09,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:43:09,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:43:09,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:43:09,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:43:09,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:43:09,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:43:09,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:43:09,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:43:09,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:43:09,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:43:09,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:43:09,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:43:09,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:43:09,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:43:09,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:43:09,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:43:09,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:43:09,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:43:09,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:43:09,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:43:09,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:43:09,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:43:09,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:43:09,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:43:09,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:43:09,286 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:09,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:43:09,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:43:09,309 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:43:09,310 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:43:09,310 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:43:09,310 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:43:09,310 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:43:09,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:43:09,311 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:43:09,312 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:43:09,312 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:43:09,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:43:09,314 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:43:09,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:43:09,314 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:43:09,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:43:09,315 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:43:09,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:43:09,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:43:09,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:43:09,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:43:09,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:43:09,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:43:09,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:43:09,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:43:09,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:43:09,320 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:43:09,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:43:09,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:43:09,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:43:09,321 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:43:09,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:43:09,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:43:09,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:43:09,383 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:43:09,384 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:43:09,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 16:43:09,384 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-12-03 16:43:09,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:43:09,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:43:09,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:09,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:43:09,443 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:43:09,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:09,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:43:09,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:43:09,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:43:09,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/1) ... [2018-12-03 16:43:09,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:43:09,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:43:09,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:43:09,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:43:09,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (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:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:43:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:43:10,254 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:43:10,255 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:43:10,255 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:10 BoogieIcfgContainer [2018-12-03 16:43:10,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:43:10,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:43:10,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:43:10,260 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:43:10,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:43:09" (1/2) ... [2018-12-03 16:43:10,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd630d7 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:10, skipping insertion in model container [2018-12-03 16:43:10,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:10" (2/2) ... [2018-12-03 16:43:10,264 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 16:43:10,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:43:10,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:43:10,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:43:10,337 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:43:10,337 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:43:10,337 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:43:10,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:43:10,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:43:10,338 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:43:10,338 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:43:10,338 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:43:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 16:43:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:10,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:10,363 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:10,366 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:10,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 16:43:10,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:10,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:10,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:10,614 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:10,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:10,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:10,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:10,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:10,642 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 16:43:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:10,710 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 16:43:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:10,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:10,729 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:43:10,729 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:43:10,734 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:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:43:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 16:43:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:43:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 16:43:10,793 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 16:43:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:10,793 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 16:43:10,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 16:43:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:10,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:10,795 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:10,795 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:10,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 16:43:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:10,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:10,911 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:10,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:10,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:10,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:10,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:10,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:10,916 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 16:43:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:10,974 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 16:43:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:10,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:10,976 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:43:10,976 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:43:10,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:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:43:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 16:43:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:43:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 16:43:10,995 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 16:43:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:10,995 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 16:43:10,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 16:43:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:10,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:10,997 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:10,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:10,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 16:43:10,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:11,092 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:11,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:11,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:11,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:11,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:11,099 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 16:43:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:11,190 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 16:43:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:11,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:11,201 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:43:11,201 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:43:11,204 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:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:43:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 16:43:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:43:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 16:43:11,242 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 16:43:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:11,243 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 16:43:11,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 16:43:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:11,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:11,244 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:11,245 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:11,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 16:43:11,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:11,336 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:11,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:11,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:11,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:11,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:11,338 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 16:43:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:11,486 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 16:43:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:11,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:11,489 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:43:11,489 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:43:11,491 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:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:43:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 16:43:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:43:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 16:43:11,545 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 16:43:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:11,545 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 16:43:11,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 16:43:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:11,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:11,550 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:11,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:11,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 16:43:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:11,782 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:11,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:11,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:43:11,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:11,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:11,785 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 16:43:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:12,027 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 16:43:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:12,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 16:43:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:12,031 INFO L225 Difference]: With dead ends: 293 [2018-12-03 16:43:12,031 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:43:12,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:43:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:43:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 16:43:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:43:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 16:43:12,091 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 16:43:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:12,092 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 16:43:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 16:43:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:12,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:12,094 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:12,095 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:12,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 16:43:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:12,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:12,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:12,260 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:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:12,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:12,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:12,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:12,262 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 16:43:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:12,377 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 16:43:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:12,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 16:43:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:12,380 INFO L225 Difference]: With dead ends: 525 [2018-12-03 16:43:12,380 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:43:12,382 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:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:43:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 16:43:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 16:43:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 16:43:12,445 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 16:43:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:12,446 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 16:43:12,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 16:43:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:12,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:12,449 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:12,449 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:12,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 16:43:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:12,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:12,796 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:43:12,894 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:12,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:12,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:12,896 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 16:43:12,898 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:12,941 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:43:12,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:43:14,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:43:14,091 INFO L272 AbstractInterpreter]: Visited 22 different actions 123 times. Merged at 20 different actions 71 times. Widened at 5 different actions 5 times. Found 29 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:43:14,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:14,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:43:14,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:14,142 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:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:14,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:14,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:14,427 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:14,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:14,802 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 16:43:14,813 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:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2018-12-03 16:43:14,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:14,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:43:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:43:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:43:14,848 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 6 states. [2018-12-03 16:43:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:15,256 INFO L93 Difference]: Finished difference Result 811 states and 1054 transitions. [2018-12-03 16:43:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:15,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 16:43:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:15,260 INFO L225 Difference]: With dead ends: 811 [2018-12-03 16:43:15,260 INFO L226 Difference]: Without dead ends: 569 [2018-12-03 16:43:15,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:43:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-03 16:43:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-12-03 16:43:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-03 16:43:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-12-03 16:43:15,358 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-12-03 16:43:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:15,358 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-12-03 16:43:15,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:43:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-12-03 16:43:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:43:15,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:15,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:43:15,363 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:15,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-12-03 16:43:15,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:15,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:15,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:15,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:15,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:15,702 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:43:16,006 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:43:16,177 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:43:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 16:43:16,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:16,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:16,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:43:16,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:43:16,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:16,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:43:16,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:43:16,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:43:16,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:43:16,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:43:16,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:16,873 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 16:43:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:43:17,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:43:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:17,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:43:17,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:17,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:43:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:43:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:43:17,306 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-12-03 16:43:18,476 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-12-03 16:43:18,808 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 16:43:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:19,649 INFO L93 Difference]: Finished difference Result 883 states and 1094 transitions. [2018-12-03 16:43:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:43:19,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-12-03 16:43:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:19,652 INFO L225 Difference]: With dead ends: 883 [2018-12-03 16:43:19,652 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 16:43:19,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:43:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 16:43:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 149. [2018-12-03 16:43:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 16:43:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-12-03 16:43:19,695 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 54 [2018-12-03 16:43:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:19,695 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-12-03 16:43:19,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:43:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-12-03 16:43:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:43:19,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:19,702 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:19,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:19,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -129171151, now seen corresponding path program 3 times [2018-12-03 16:43:19,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:19,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:43:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:19,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 16:43:19,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:19,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:19,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:19,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:19,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:19,789 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 3 states. [2018-12-03 16:43:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:19,796 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2018-12-03 16:43:19,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:19,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:43:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:19,797 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:43:19,797 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:19,798 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:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:19,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 16:43:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:19,800 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:19,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:19,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:19,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:19,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:19,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:19,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:19,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:19,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:19,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:22,126 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 16:43:22,543 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 16:43:23,088 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 16:43:23,251 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 16:43:23,534 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 16:43:23,737 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 16:43:23,849 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-03 16:43:24,014 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 16:43:24,675 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 16:43:24,929 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 16:43:25,201 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 16:43:25,622 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 16:43:25,626 INFO L444 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 16:43:25,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:25,627 INFO L444 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse4 (<= ~r1 1)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3)) (.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 16:43:25,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:25,627 INFO L444 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 16:43:25,627 INFO L444 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-12-03 16:43:25,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:25,628 INFO L444 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 16:43:25,628 INFO L444 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (<= v_prenex_1 127) (= .cse9 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2018-12-03 16:43:25,628 INFO L444 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 16:43:25,629 INFO L444 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 16:43:25,629 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-12-03 16:43:25,629 INFO L444 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 16:43:25,629 INFO L444 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 16:43:25,630 INFO L444 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 16:43:25,630 INFO L444 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 16:43:25,630 INFO L444 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 16:43:25,630 INFO L444 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 16:43:25,658 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.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,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:25,659 INFO L168 Benchmark]: Toolchain (without parser) took 16218.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -580.3 MB). Peak memory consumption was 618.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:25,661 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:25,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:25,662 INFO L168 Benchmark]: Boogie Preprocessor took 61.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:25,662 INFO L168 Benchmark]: RCFGBuilder took 708.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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,663 INFO L168 Benchmark]: TraceAbstraction took 15401.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -622.6 MB). Peak memory consumption was 576.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:25,667 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 708.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 15401.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 826.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -622.6 MB). Peak memory consumption was 576.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 213 SDslu, 235 SDs, 0 SdLazy, 186 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 207 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 2286 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5225 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 951 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 321 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 15 QuantifiedInterpolants, 121117 SizeOfPredicates, 12 NumberOfNonLiveVariables, 512 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 260/364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...