java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:22:11,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:22:11,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:22:11,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:22:11,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:22:11,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:22:11,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:22:11,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:22:11,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:22:11,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:22:11,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:22:11,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:22:11,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:22:11,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:22:11,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:22:11,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:22:11,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:22:11,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:22:11,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:22:11,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:22:11,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:22:11,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:22:11,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:22:11,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:22:11,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:22:11,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:22:11,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:22:11,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:22:11,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:22:11,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:22:11,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:22:11,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:22:11,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:22:11,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:22:11,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:22:11,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:22:11,517 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:22:11,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:22:11,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:22:11,540 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:22:11,540 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:22:11,541 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:22:11,541 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:22:11,541 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:22:11,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:22:11,541 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:22:11,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:22:11,542 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:22:11,542 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:22:11,542 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:22:11,542 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:22:11,542 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:22:11,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:22:11,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:22:11,544 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:22:11,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:22:11,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:22:11,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:22:11,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:22:11,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:22:11,545 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:22:11,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:22:11,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:22:11,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:22:11,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:22:11,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:22:11,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:22:11,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:22:11,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:22:11,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:11,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:22:11,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:22:11,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:22:11,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:22:11,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:22:11,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:22:11,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:22:11,548 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:22:11,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:22:11,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:22:11,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:22:11,602 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:22:11,604 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:22:11,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-12-03 15:22:11,605 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl' [2018-12-03 15:22:11,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:22:11,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:22:11,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:11,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:22:11,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:22:11,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:11,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:22:11,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:22:11,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:22:11,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... [2018-12-03 15:22:11,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:22:11,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:22:11,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:22:11,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:22:11,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:11,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:22:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:22:11,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:22:12,441 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:22:12,442 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:22:12,442 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:12 BoogieIcfgContainer [2018-12-03 15:22:12,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:22:12,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:22:12,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:22:12,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:22:12,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:11" (1/2) ... [2018-12-03 15:22:12,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37899ba7 and model type pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:22:12, skipping insertion in model container [2018-12-03 15:22:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:12" (2/2) ... [2018-12-03 15:22:12,451 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-12-03 15:22:12,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:22:12,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:22:12,488 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:22:12,528 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:22:12,528 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:22:12,528 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:22:12,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:22:12,529 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:22:12,529 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:22:12,529 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:22:12,529 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:22:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:22:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:12,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:12,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:12,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:12,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 15:22:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:12,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:12,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:12,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:12,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:12,799 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 15:22:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:12,849 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-03 15:22:12,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:12,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:12,863 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:22:12,863 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:22:12,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:22:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:22:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:22:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-03 15:22:12,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-12-03 15:22:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:12,907 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-03 15:22:12,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-03 15:22:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:12,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:12,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:12,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:12,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 15:22:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:12,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:12,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:12,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:12,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:12,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:12,986 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2018-12-03 15:22:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,038 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-12-03 15:22:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:13,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,040 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:22:13,041 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:22:13,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:22:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 15:22:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:22:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-12-03 15:22:13,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 14 [2018-12-03 15:22:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,051 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-03 15:22:13,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-12-03 15:22:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:13,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-12-03 15:22:13,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:13,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:13,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:13,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:13,156 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 3 states. [2018-12-03 15:22:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,206 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2018-12-03 15:22:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:13,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,208 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:22:13,208 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:22:13,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:22:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:22:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:22:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-03 15:22:13,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 14 [2018-12-03 15:22:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,222 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-03 15:22:13,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-12-03 15:22:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:13,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,223 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1664872853, now seen corresponding path program 1 times [2018-12-03 15:22:13,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:13,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:13,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:13,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:13,340 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-12-03 15:22:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,412 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2018-12-03 15:22:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:13,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,415 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:22:13,415 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:22:13,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:22:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-03 15:22:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:22:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-12-03 15:22:13,431 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 14 [2018-12-03 15:22:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,431 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2018-12-03 15:22:13,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2018-12-03 15:22:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:13,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1607614551, now seen corresponding path program 1 times [2018-12-03 15:22:13,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:13,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:13,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:13,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:13,573 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 4 states. [2018-12-03 15:22:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,720 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-12-03 15:22:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:13,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,724 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:22:13,725 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:22:13,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:22:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-12-03 15:22:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:22:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2018-12-03 15:22:13,748 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 14 [2018-12-03 15:22:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,749 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2018-12-03 15:22:13,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-12-03 15:22:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:13,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,751 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1607674133, now seen corresponding path program 1 times [2018-12-03 15:22:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:13,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:13,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:13,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:13,847 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 4 states. [2018-12-03 15:22:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,973 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2018-12-03 15:22:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:13,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,975 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:22:13,976 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:22:13,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:22:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-12-03 15:22:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:22:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-12-03 15:22:13,997 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 14 [2018-12-03 15:22:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,997 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-12-03 15:22:13,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-12-03 15:22:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:13,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,999 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:13,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:14,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1173123511, now seen corresponding path program 1 times [2018-12-03 15:22:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:14,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:14,105 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:14,107 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 15:22:14,147 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:14,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:15,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:15,250 INFO L272 AbstractInterpreter]: Visited 20 different actions 127 times. Merged at 19 different actions 77 times. Widened at 7 different actions 12 times. Found 32 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:22:15,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:15,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:15,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:15,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:15,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:15,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:15,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:22:15,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 15:22:15,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:15,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:22:15,614 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 3 states. [2018-12-03 15:22:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:15,660 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-03 15:22:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:15,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:22:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:15,664 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:22:15,664 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:22:15,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:22:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:22:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:22:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:22:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:22:15,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-12-03 15:22:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:15,667 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:22:15,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:22:15,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:22:15,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:22:15,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:15,940 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-12-03 15:22:16,155 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2018-12-03 15:22:16,496 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 20 [2018-12-03 15:22:17,120 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 20 [2018-12-03 15:22:17,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-12-03 15:22:17,123 INFO L444 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (or (and (<= 512 ~mode3) (= ~mode2 0) (<= (+ ~r1 256) 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,123 INFO L444 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_check_~tmp~77))) (or (and (<= (+ ~r1 256) 0) .cse0) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256) .cse0))) [2018-12-03 15:22:17,124 INFO L444 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (or (and (<= 512 ~mode3) (= ~mode2 0) (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,124 INFO L444 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256)) (and (<= 512 ~mode3) (<= (+ ~r1 256) 0))) [2018-12-03 15:22:17,124 INFO L444 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-12-03 15:22:17,124 INFO L444 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_assert_#in~arg|)))) (or (and (<= (+ ~r1 256) 0) (<= 1 ULTIMATE.start_check_~tmp~77) .cse0 (<= 1 ULTIMATE.start_main_~c1~84)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256) .cse0))) [2018-12-03 15:22:17,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-12-03 15:22:17,125 INFO L444 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_check_~tmp~77)) (.cse1 (<= 1 ULTIMATE.start_main_~c1~84))) (or (and (<= (+ ~r1 256) 0) .cse0 .cse1) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256) .cse0 .cse1))) [2018-12-03 15:22:17,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-12-03 15:22:17,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-12-03 15:22:17,125 INFO L444 ceAbstractionStarter]: At program point L214(lines 208 215) the Hoare annotation is: (or (and (<= 512 ~mode3) (= ~mode2 0) (<= (+ ~r1 256) 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,126 INFO L444 ceAbstractionStarter]: At program point L243(lines 243 253) the Hoare annotation is: (or (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256)) (and (<= 512 ~mode3) (<= (+ ~r1 256) 0))) [2018-12-03 15:22:17,126 INFO L444 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-12-03 15:22:17,126 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (or (<= (+ ~r1 256) 0) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,126 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 209) the Hoare annotation is: (or (and (<= 512 ~mode3) (= ~mode2 0) (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,126 INFO L444 ceAbstractionStarter]: At program point L258(lines 252 259) the Hoare annotation is: (or (<= (+ ~r1 256) 0) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~r1 256))) [2018-12-03 15:22:17,138 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:22:17 BoogieIcfgContainer [2018-12-03 15:22:17,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:22:17,140 INFO L168 Benchmark]: Toolchain (without parser) took 5468.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -517.4 MB). Peak memory consumption was 214.5 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:17,141 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:17,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:17,142 INFO L168 Benchmark]: Boogie Preprocessor took 37.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:17,144 INFO L168 Benchmark]: RCFGBuilder took 690.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:17,146 INFO L168 Benchmark]: TraceAbstraction took 4695.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.1 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:17,150 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 690.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4695.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.1 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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: 219]: Loop Invariant Derived loop invariant: ((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) || (!(0 == assert_~arg) && ~r1 <= 256) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) || (!(0 == assert_~arg) && ~r1 <= 256) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (!(0 == assert_~arg) && ~r1 <= 256) || (512 <= ~mode3 && ~r1 + 256 <= 0) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((~r1 + 256 <= 0 && 1 <= check_~tmp~77) && !(0 == assert_#in~arg)) && 1 <= main_~c1~84) || ((!(0 == assert_~arg) && ~r1 <= 256) && !(0 == assert_#in~arg)) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((~r1 + 256 <= 0 && 1 <= check_~tmp~77) && 1 <= main_~c1~84) || (((!(0 == assert_~arg) && ~r1 <= 256) && 1 <= check_~tmp~77) && 1 <= main_~c1~84) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) || (!(0 == assert_~arg) && ~r1 <= 256) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ~r1 + 256 <= 0 || (!(0 == assert_~arg) && ~r1 <= 256) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (!(0 == assert_~arg) && ~r1 <= 256) || (512 <= ~mode3 && ~r1 + 256 <= 0) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ~r1 + 256 <= 0 || (!(0 == assert_~arg) && ~r1 <= 256) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (!(0 == assert_~arg) && ~r1 <= 256) && !(0 == assert_#in~arg) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (~r1 + 256 <= 0 && 1 <= check_~tmp~77) || ((!(0 == assert_~arg) && ~r1 <= 256) && 1 <= check_~tmp~77) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) || (!(0 == assert_~arg) && ~r1 <= 256) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 107 SDslu, 138 SDs, 0 SdLazy, 36 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 67 NumberOfFragments, 248 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1816 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 35 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 6099 SizeOfPredicates, 2 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...