java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:47,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:47,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:47,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:47,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:47,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:47,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:47,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:47,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:47,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:47,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:47,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:47,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:47,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:47,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:47,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:47,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:47,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:47,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:47,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:47,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:47,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:47,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:47,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:47,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:47,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:47,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:47,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:47,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:47,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:47,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:47,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:47,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:47,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:47,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:47,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:47,976 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:41:48,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:48,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:48,005 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:48,005 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:48,005 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:48,006 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:48,007 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:48,007 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:48,007 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:48,007 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:48,007 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:48,008 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:48,008 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:48,008 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:48,008 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:48,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:48,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:48,010 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:48,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:48,011 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:48,011 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:48,011 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:48,011 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:48,011 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:48,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:48,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:48,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:48,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:48,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:48,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:48,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:48,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:48,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:48,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:48,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:48,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:48,016 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:48,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:48,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:48,017 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:48,017 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:48,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:48,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:48,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:48,080 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:48,080 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:48,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl [2018-12-03 15:41:48,082 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl' [2018-12-03 15:41:48,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:48,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:48,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:48,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:48,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:48,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:48,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:48,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:48,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:48,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/1) ... [2018-12-03 15:41:48,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:48,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:48,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:48,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:48,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (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:41:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:48,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:48,547 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 15:41:48,548 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:48 BoogieIcfgContainer [2018-12-03 15:41:48,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:48,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:48,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:48,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:48,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:48" (1/2) ... [2018-12-03 15:41:48,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b29c7ac and model type string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:48, skipping insertion in model container [2018-12-03 15:41:48,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:48" (2/2) ... [2018-12-03 15:41:48,556 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i_3.bpl [2018-12-03 15:41:48,566 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:48,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:48,593 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:48,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:48,626 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:48,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:48,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:48,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:48,627 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:48,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:48,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 15:41:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:41:48,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:48,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:41:48,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:48,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-12-03 15:41:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:48,849 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:41:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:48,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:48,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:48,876 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 15:41:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:48,916 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 15:41:48,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:48,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 15:41:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:48,931 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:41:48,931 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:41:48,935 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:41:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:41:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:41:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:41:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:41:48,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 15:41:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:48,971 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:41:48,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:41:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:41:48,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:48,972 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:41:48,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:48,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-12-03 15:41:48,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:49,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:49,135 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 15:41:49,138 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2018-12-03 15:41:49,188 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:49,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:49,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:49,577 INFO L272 AbstractInterpreter]: Visited 5 different actions 18 times. Merged at 4 different actions 13 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:41:49,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:49,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:49,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:49,629 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:41:49,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:49,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:49,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:49,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 15:41:49,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:49,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:41:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:41:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:41:49,850 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:41:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:49,873 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 15:41:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:41:49,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:41:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:49,874 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:41:49,874 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:41:49,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:41:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:41:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:41:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:41:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:41:49,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2018-12-03 15:41:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:49,881 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:41:49,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:41:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:41:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:41:49,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:49,882 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 15:41:49,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:49,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 2 times [2018-12-03 15:41:49,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:49,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:49,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:49,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:49,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:50,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:50,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:50,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,079 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 15:41:50,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:50,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:50,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:41:50,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:50,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:50,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 15:41:50,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:50,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:41:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:41:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:50,813 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 15:41:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:50,976 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 15:41:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:41:50,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:41:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:50,979 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:41:50,979 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:41:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:41:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:41:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:41:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:41:50,987 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2018-12-03 15:41:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:50,987 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:41:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:41:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:41:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:41:50,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:50,989 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-12-03 15:41:50,989 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:50,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 3 times [2018-12-03 15:41:50,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:50,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:50,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:51,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:51,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:51,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:51,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:51,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:51,247 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:51,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:51,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:51,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:51,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:51,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:51,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:52,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2018-12-03 15:41:52,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:41:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:41:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:41:52,589 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 15:41:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:52,775 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-12-03 15:41:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:41:52,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 15:41:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:52,777 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:41:52,778 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:41:52,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:41:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:41:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:41:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:41:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 15:41:52,788 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2018-12-03 15:41:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:52,788 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 15:41:52,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:41:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 15:41:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:41:52,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:52,791 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-12-03 15:41:52,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:52,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 4 times [2018-12-03 15:41:52,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:52,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:52,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:53,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:53,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:53,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:53,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,400 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:53,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:53,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:53,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:54,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:58,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2018-12-03 15:41:58,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:58,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:41:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:41:58,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:41:58,140 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 15:41:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:58,687 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2018-12-03 15:41:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:41:58,687 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 15:41:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:58,689 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:41:58,689 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:41:58,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:41:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:41:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:41:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:41:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 15:41:58,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 48 [2018-12-03 15:41:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:58,706 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 15:41:58,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:41:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 15:41:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:41:58,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:58,709 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-12-03 15:41:58,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:58,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 5 times [2018-12-03 15:41:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:58,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:58,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:58,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:58,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:00,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:00,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:00,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:00,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:00,794 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:00,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:00,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:01,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 15:42:01,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:01,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:04,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:08,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:08,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2018-12-03 15:42:08,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:08,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:42:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:42:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:42:08,905 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 15:42:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:09,668 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2018-12-03 15:42:09,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:42:09,668 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 15:42:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:09,674 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:42:09,675 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:42:09,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:42:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:42:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 15:42:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 15:42:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-12-03 15:42:09,701 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 96 [2018-12-03 15:42:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:09,701 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-12-03 15:42:09,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:42:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-12-03 15:42:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 15:42:09,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:09,705 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-12-03 15:42:09,705 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:09,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 6 times [2018-12-03 15:42:09,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:09,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:09,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:13,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:13,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:13,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:13,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:13,644 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:13,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:13,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:13,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:13,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:23,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 197 [2018-12-03 15:42:36,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 15:42:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 15:42:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:42:36,056 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-12-03 15:42:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:37,338 INFO L93 Difference]: Finished difference Result 387 states and 482 transitions. [2018-12-03 15:42:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-12-03 15:42:37,339 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-12-03 15:42:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:37,343 INFO L225 Difference]: With dead ends: 387 [2018-12-03 15:42:37,343 INFO L226 Difference]: Without dead ends: 385 [2018-12-03 15:42:37,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 193 SyntacticMatches, 89 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4450 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:42:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-03 15:42:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-12-03 15:42:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-12-03 15:42:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-12-03 15:42:37,378 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 192 [2018-12-03 15:42:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:37,379 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-12-03 15:42:37,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 15:42:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-12-03 15:42:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-12-03 15:42:37,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:37,388 INFO L402 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1] [2018-12-03 15:42:37,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:37,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1247344141, now seen corresponding path program 7 times [2018-12-03 15:42:37,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:37,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:37,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 36290 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:52,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:42:52,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [192] imperfect sequences [] total 192 [2018-12-03 15:42:52,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:42:52,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-12-03 15:42:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-12-03 15:42:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 15:42:52,521 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 193 states. [2018-12-03 15:42:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:53,701 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-12-03 15:42:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-12-03 15:42:53,701 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 384 [2018-12-03 15:42:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:53,703 INFO L225 Difference]: With dead ends: 385 [2018-12-03 15:42:53,703 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:42:53,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 15:42:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:42:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:42:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:42:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:42:53,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 384 [2018-12-03 15:42:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:53,707 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:42:53,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-12-03 15:42:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:42:53,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:42:53,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:42:54,089 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 768 [2018-12-03 15:42:54,448 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 768 [2018-12-03 15:43:01,286 WARN L180 SmtUtils]: Spent 6.83 s on a formula simplification. DAG size of input: 768 DAG size of output: 768 [2018-12-03 15:43:07,029 WARN L180 SmtUtils]: Spent 5.70 s on a formula simplification. DAG size of input: 768 DAG size of output: 768 [2018-12-03 15:43:07,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 54) no Hoare annotation was computed. [2018-12-03 15:43:07,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 54) no Hoare annotation was computed. [2018-12-03 15:43:07,036 INFO L444 ceAbstractionStarter]: At program point L29(lines 29 42) the Hoare annotation is: (or (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 102)) (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 122) (<= 118 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= ULTIMATE.start_main_~i~5 150) (<= 146 ULTIMATE.start_main_~j~5)) (and (<= 172 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 176)) (and (<= 132 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 136)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 182) (<= 178 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 135) (<= 131 ULTIMATE.start_main_~j~5)) (and (<= 185 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 189)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= 138 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 142)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 183) (<= 179 ULTIMATE.start_main_~j~5)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 187 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 191)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= ULTIMATE.start_main_~i~5 170) (<= 166 ULTIMATE.start_main_~j~5)) (and (<= 121 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 125)) (and (<= ULTIMATE.start_main_~i~5 104) (<= 100 ULTIMATE.start_main_~j~5)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 107) (<= 103 ULTIMATE.start_main_~j~5)) (and (<= 107 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 111)) (and (<= ULTIMATE.start_main_~i~5 193) (<= 189 ULTIMATE.start_main_~j~5)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 95 ULTIMATE.start_main_~j~5) (< ULTIMATE.start_main_~i~5 100)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 137 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 141)) (and (<= ULTIMATE.start_main_~i~5 178) (<= 174 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 183 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 187)) (and (<= ULTIMATE.start_main_~i~5 164) (<= 160 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 152) (<= 148 ULTIMATE.start_main_~j~5)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 100)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 145 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 149)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 144) (<= 140 ULTIMATE.start_main_~j~5)) (and (<= 110 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 114)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 164 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 168)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 106) (<= 102 ULTIMATE.start_main_~j~5)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= 156 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 160)) (and (<= ULTIMATE.start_main_~i~5 119) (<= 115 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 130) (<= 126 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 140) (<= 136 ULTIMATE.start_main_~j~5)) (and (<= 170 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 174)) (and (<= ULTIMATE.start_main_~i~5 185) (<= 181 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 129) (<= 125 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 103) (<= 99 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= 161 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 165)) (and (<= ULTIMATE.start_main_~i~5 171) (<= 167 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 172) (<= 168 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 179) (<= 175 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 117) (<= 113 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 108) (<= 104 ULTIMATE.start_main_~j~5)) (and (<= 117 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 121)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 171 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 175)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= ULTIMATE.start_main_~i~5 112) (<= 108 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 190) (<= 186 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= ULTIMATE.start_main_~i~5 169) (<= 165 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 154) (<= 150 ULTIMATE.start_main_~j~5)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 142 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 146)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 130 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 134)) (and (<= 155 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 159)) (and (<= 182 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 186)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (<= 190 ULTIMATE.start_main_~j~5) (and (<= ULTIMATE.start_main_~i~5 163) (<= 159 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 180) (<= 176 ULTIMATE.start_main_~j~5)) (and (<= 139 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 143)) (and (<= 173 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 177)) (and (<= ULTIMATE.start_main_~i~5 145) (<= 141 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 118) (<= 114 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 112 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 116)) (and (<= 180 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 184)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= 123 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 127)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= 153 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 157)) (and (<= 184 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 188)) (and (<= 111 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 115)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 131) (<= 127 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 123) (<= 119 ULTIMATE.start_main_~j~5)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= 105 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 109)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= 169 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 173)) (and (<= ULTIMATE.start_main_~i~5 139) (<= 135 ULTIMATE.start_main_~j~5)) (and (<= 162 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 166)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 181) (<= 177 ULTIMATE.start_main_~j~5)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= ULTIMATE.start_main_~i~5 101) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 101 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 105)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 158 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 162)) (and (<= 154 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 158)) (and (<= 124 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 128)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 129 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 133)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 113) (<= 109 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 151) (<= 147 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= ULTIMATE.start_main_~i~5 148) (<= 144 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= 163 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 167)) (and (<= ULTIMATE.start_main_~i~5 161) (<= 157 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 192) (<= 188 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 133 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 137)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (and (<= ULTIMATE.start_main_~i~5 120) (<= 116 ULTIMATE.start_main_~j~5)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 134 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 138)) (and (<= 151 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 155)) (and (<= 143 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 147)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 124) (<= 120 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= ULTIMATE.start_main_~i~5 156) (<= 152 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 110) (<= 106 ULTIMATE.start_main_~j~5)) (and (<= 122 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 126)) (and (<= ULTIMATE.start_main_~i~5 132) (<= 128 ULTIMATE.start_main_~j~5)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 149 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 153))) [2018-12-03 15:43:07,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 54) no Hoare annotation was computed. [2018-12-03 15:43:07,036 INFO L444 ceAbstractionStarter]: At program point L51(lines 51 52) the Hoare annotation is: false [2018-12-03 15:43:07,037 INFO L444 ceAbstractionStarter]: At program point L41(lines 25 41) the Hoare annotation is: (or (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 102)) (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 122) (<= 118 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= ULTIMATE.start_main_~i~5 150) (<= 146 ULTIMATE.start_main_~j~5)) (and (<= 172 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 176)) (and (<= 132 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 136)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 182) (<= 178 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 135) (<= 131 ULTIMATE.start_main_~j~5)) (and (<= 185 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 189)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= 138 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 142)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 183) (<= 179 ULTIMATE.start_main_~j~5)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 187 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 191)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= ULTIMATE.start_main_~i~5 170) (<= 166 ULTIMATE.start_main_~j~5)) (and (<= 121 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 125)) (and (<= ULTIMATE.start_main_~i~5 104) (<= 100 ULTIMATE.start_main_~j~5)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 107) (<= 103 ULTIMATE.start_main_~j~5)) (and (<= 107 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 111)) (and (<= ULTIMATE.start_main_~i~5 193) (<= 189 ULTIMATE.start_main_~j~5)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 95 ULTIMATE.start_main_~j~5) (< ULTIMATE.start_main_~i~5 100)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 137 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 141)) (and (<= ULTIMATE.start_main_~i~5 178) (<= 174 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 183 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 187)) (and (<= ULTIMATE.start_main_~i~5 164) (<= 160 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 152) (<= 148 ULTIMATE.start_main_~j~5)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 100)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 145 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 149)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 144) (<= 140 ULTIMATE.start_main_~j~5)) (and (<= 110 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 114)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 164 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 168)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 106) (<= 102 ULTIMATE.start_main_~j~5)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= 156 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 160)) (and (<= ULTIMATE.start_main_~i~5 119) (<= 115 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 130) (<= 126 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 140) (<= 136 ULTIMATE.start_main_~j~5)) (and (<= 170 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 174)) (and (<= ULTIMATE.start_main_~i~5 185) (<= 181 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 129) (<= 125 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 103) (<= 99 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= 161 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 165)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 171) (<= 167 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 172) (<= 168 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 179) (<= 175 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 117) (<= 113 ULTIMATE.start_main_~j~5)) (and (<= 117 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 121)) (and (<= ULTIMATE.start_main_~i~5 108) (<= 104 ULTIMATE.start_main_~j~5)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 171 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 175)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= ULTIMATE.start_main_~i~5 112) (<= 108 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 190) (<= 186 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= ULTIMATE.start_main_~i~5 169) (<= 165 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 154) (<= 150 ULTIMATE.start_main_~j~5)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 142 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 146)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 130 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 134)) (and (<= 155 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 159)) (and (<= 182 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 186)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (<= 190 ULTIMATE.start_main_~j~5) (and (<= ULTIMATE.start_main_~i~5 163) (<= 159 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 180) (<= 176 ULTIMATE.start_main_~j~5)) (and (<= 139 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 143)) (and (<= 173 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 177)) (and (<= ULTIMATE.start_main_~i~5 145) (<= 141 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 118) (<= 114 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 112 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 116)) (and (<= 180 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 184)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= 123 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 127)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= 153 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 157)) (and (<= 184 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 188)) (and (<= 111 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 115)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 131) (<= 127 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 123) (<= 119 ULTIMATE.start_main_~j~5)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= 105 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 109)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= 169 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 173)) (and (<= ULTIMATE.start_main_~i~5 139) (<= 135 ULTIMATE.start_main_~j~5)) (and (<= 162 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 166)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 181) (<= 177 ULTIMATE.start_main_~j~5)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= ULTIMATE.start_main_~i~5 101) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 101 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 105)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 158 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 162)) (and (<= 154 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 158)) (and (<= 124 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 128)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 129 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 133)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 113) (<= 109 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 151) (<= 147 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= ULTIMATE.start_main_~i~5 148) (<= 144 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= 163 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 167)) (and (<= ULTIMATE.start_main_~i~5 161) (<= 157 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 192) (<= 188 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 133 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 137)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (and (<= ULTIMATE.start_main_~i~5 120) (<= 116 ULTIMATE.start_main_~j~5)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 134 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 138)) (and (<= 151 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 155)) (and (<= 143 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 147)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 124) (<= 120 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= ULTIMATE.start_main_~i~5 156) (<= 152 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 110) (<= 106 ULTIMATE.start_main_~j~5)) (and (<= 122 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 126)) (and (<= ULTIMATE.start_main_~i~5 132) (<= 128 ULTIMATE.start_main_~j~5)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 149 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 153))) [2018-12-03 15:43:07,038 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 53) no Hoare annotation was computed. [2018-12-03 15:43:07,074 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:43:07 BoogieIcfgContainer [2018-12-03 15:43:07,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:43:07,076 INFO L168 Benchmark]: Toolchain (without parser) took 78947.04 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -319.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-03 15:43:07,077 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:43:07,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.72 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:43:07,078 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 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:43:07,078 INFO L168 Benchmark]: RCFGBuilder took 356.82 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:43:07,079 INFO L168 Benchmark]: TraceAbstraction took 78525.87 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-03 15:43:07,083 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 34.72 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 24.68 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 356.82 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78525.87 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: 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: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((79 <= main_~j~5 && main_~i~5 <= 79) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 102)) || (main_~i~5 <= 58 && 58 <= main_~j~5)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 122 && 118 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (main_~i~5 <= 150 && 146 <= main_~j~5)) || (172 <= main_~j~5 && main_~i~5 <= 176)) || (132 <= main_~j~5 && main_~i~5 <= 136)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 182 && 178 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (main_~i~5 <= 135 && 131 <= main_~j~5)) || (185 <= main_~j~5 && main_~i~5 <= 189)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (138 <= main_~j~5 && main_~i~5 <= 142)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 183 && 179 <= main_~j~5)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (187 <= main_~j~5 && main_~i~5 <= 191)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (main_~i~5 <= 170 && 166 <= main_~j~5)) || (121 <= main_~j~5 && main_~i~5 <= 125)) || (main_~i~5 <= 104 && 100 <= main_~j~5)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 107 && 103 <= main_~j~5)) || (107 <= main_~j~5 && main_~i~5 <= 111)) || (main_~i~5 <= 193 && 189 <= main_~j~5)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (95 <= main_~j~5 && main_~i~5 < 100)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (137 <= main_~j~5 && main_~i~5 <= 141)) || (main_~i~5 <= 178 && 174 <= main_~j~5)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (183 <= main_~j~5 && main_~i~5 <= 187)) || (main_~i~5 <= 164 && 160 <= main_~j~5)) || (main_~i~5 <= 152 && 148 <= main_~j~5)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (96 <= main_~j~5 && main_~i~5 <= 100)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (145 <= main_~j~5 && main_~i~5 <= 149)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 144 && 140 <= main_~j~5)) || (110 <= main_~j~5 && main_~i~5 <= 114)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (164 <= main_~j~5 && main_~i~5 <= 168)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (main_~i~5 <= 106 && 102 <= main_~j~5)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (156 <= main_~j~5 && main_~i~5 <= 160)) || (main_~i~5 <= 119 && 115 <= main_~j~5)) || (main_~i~5 <= 130 && 126 <= main_~j~5)) || (main_~i~5 <= 140 && 136 <= main_~j~5)) || (170 <= main_~j~5 && main_~i~5 <= 174)) || (main_~i~5 <= 185 && 181 <= main_~j~5)) || (main_~i~5 <= 129 && 125 <= main_~j~5)) || (main_~i~5 <= 103 && 99 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (161 <= main_~j~5 && main_~i~5 <= 165)) || (main_~i~5 <= 171 && 167 <= main_~j~5)) || (main_~i~5 <= 172 && 168 <= main_~j~5)) || (main_~i~5 <= 179 && 175 <= main_~j~5)) || (main_~i~5 <= 117 && 113 <= main_~j~5)) || (main_~i~5 <= 108 && 104 <= main_~j~5)) || (117 <= main_~j~5 && main_~i~5 <= 121)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (171 <= main_~j~5 && main_~i~5 <= 175)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (main_~i~5 <= 112 && 108 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (main_~i~5 <= 190 && 186 <= main_~j~5)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (main_~i~5 <= 169 && 165 <= main_~j~5)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (main_~i~5 <= 154 && 150 <= main_~j~5)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (142 <= main_~j~5 && main_~i~5 <= 146)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (130 <= main_~j~5 && main_~i~5 <= 134)) || (155 <= main_~j~5 && main_~i~5 <= 159)) || (182 <= main_~j~5 && main_~i~5 <= 186)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || 190 <= main_~j~5) || (main_~i~5 <= 163 && 159 <= main_~j~5)) || (main_~i~5 <= 180 && 176 <= main_~j~5)) || (139 <= main_~j~5 && main_~i~5 <= 143)) || (173 <= main_~j~5 && main_~i~5 <= 177)) || (main_~i~5 <= 145 && 141 <= main_~j~5)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 118 && 114 <= main_~j~5)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (112 <= main_~j~5 && main_~i~5 <= 116)) || (180 <= main_~j~5 && main_~i~5 <= 184)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (123 <= main_~j~5 && main_~i~5 <= 127)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (153 <= main_~j~5 && main_~i~5 <= 157)) || (184 <= main_~j~5 && main_~i~5 <= 188)) || (111 <= main_~j~5 && main_~i~5 <= 115)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 131 && 127 <= main_~j~5)) || (main_~i~5 <= 123 && 119 <= main_~j~5)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (105 <= main_~j~5 && main_~i~5 <= 109)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (169 <= main_~j~5 && main_~i~5 <= 173)) || (main_~i~5 <= 139 && 135 <= main_~j~5)) || (162 <= main_~j~5 && main_~i~5 <= 166)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (main_~i~5 <= 181 && 177 <= main_~j~5)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (main_~i~5 <= 101 && 97 <= main_~j~5)) || (101 <= main_~j~5 && main_~i~5 <= 105)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (81 <= main_~j~5 && main_~i~5 <= 81)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (158 <= main_~j~5 && main_~i~5 <= 162)) || (154 <= main_~j~5 && main_~i~5 <= 158)) || (124 <= main_~j~5 && main_~i~5 <= 128)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (129 <= main_~j~5 && main_~i~5 <= 133)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (main_~i~5 <= 113 && 109 <= main_~j~5)) || (main_~i~5 <= 151 && 147 <= main_~j~5)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (main_~i~5 <= 148 && 144 <= main_~j~5)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (163 <= main_~j~5 && main_~i~5 <= 167)) || (main_~i~5 <= 161 && 157 <= main_~j~5)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 192 && 188 <= main_~j~5)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (133 <= main_~j~5 && main_~i~5 <= 137)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || (main_~i~5 <= 120 && 116 <= main_~j~5)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (134 <= main_~j~5 && main_~i~5 <= 138)) || (151 <= main_~j~5 && main_~i~5 <= 155)) || (143 <= main_~j~5 && main_~i~5 <= 147)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 124 && 120 <= main_~j~5)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (main_~i~5 <= 156 && 152 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (main_~i~5 <= 110 && 106 <= main_~j~5)) || (122 <= main_~j~5 && main_~i~5 <= 126)) || (main_~i~5 <= 132 && 128 <= main_~j~5)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (149 <= main_~j~5 && main_~i~5 <= 153) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((79 <= main_~j~5 && main_~i~5 <= 79) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 102)) || (main_~i~5 <= 58 && 58 <= main_~j~5)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 122 && 118 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (main_~i~5 <= 150 && 146 <= main_~j~5)) || (172 <= main_~j~5 && main_~i~5 <= 176)) || (132 <= main_~j~5 && main_~i~5 <= 136)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 182 && 178 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (main_~i~5 <= 135 && 131 <= main_~j~5)) || (185 <= main_~j~5 && main_~i~5 <= 189)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (138 <= main_~j~5 && main_~i~5 <= 142)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 183 && 179 <= main_~j~5)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (187 <= main_~j~5 && main_~i~5 <= 191)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (main_~i~5 <= 170 && 166 <= main_~j~5)) || (121 <= main_~j~5 && main_~i~5 <= 125)) || (main_~i~5 <= 104 && 100 <= main_~j~5)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 107 && 103 <= main_~j~5)) || (107 <= main_~j~5 && main_~i~5 <= 111)) || (main_~i~5 <= 193 && 189 <= main_~j~5)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (95 <= main_~j~5 && main_~i~5 < 100)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (137 <= main_~j~5 && main_~i~5 <= 141)) || (main_~i~5 <= 178 && 174 <= main_~j~5)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (183 <= main_~j~5 && main_~i~5 <= 187)) || (main_~i~5 <= 164 && 160 <= main_~j~5)) || (main_~i~5 <= 152 && 148 <= main_~j~5)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (96 <= main_~j~5 && main_~i~5 <= 100)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (145 <= main_~j~5 && main_~i~5 <= 149)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 144 && 140 <= main_~j~5)) || (110 <= main_~j~5 && main_~i~5 <= 114)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (164 <= main_~j~5 && main_~i~5 <= 168)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (main_~i~5 <= 106 && 102 <= main_~j~5)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (156 <= main_~j~5 && main_~i~5 <= 160)) || (main_~i~5 <= 119 && 115 <= main_~j~5)) || (main_~i~5 <= 130 && 126 <= main_~j~5)) || (main_~i~5 <= 140 && 136 <= main_~j~5)) || (170 <= main_~j~5 && main_~i~5 <= 174)) || (main_~i~5 <= 185 && 181 <= main_~j~5)) || (main_~i~5 <= 129 && 125 <= main_~j~5)) || (main_~i~5 <= 103 && 99 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (161 <= main_~j~5 && main_~i~5 <= 165)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (main_~i~5 <= 171 && 167 <= main_~j~5)) || (main_~i~5 <= 172 && 168 <= main_~j~5)) || (main_~i~5 <= 179 && 175 <= main_~j~5)) || (main_~i~5 <= 117 && 113 <= main_~j~5)) || (117 <= main_~j~5 && main_~i~5 <= 121)) || (main_~i~5 <= 108 && 104 <= main_~j~5)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (171 <= main_~j~5 && main_~i~5 <= 175)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (main_~i~5 <= 112 && 108 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (main_~i~5 <= 190 && 186 <= main_~j~5)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (main_~i~5 <= 169 && 165 <= main_~j~5)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (main_~i~5 <= 154 && 150 <= main_~j~5)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (142 <= main_~j~5 && main_~i~5 <= 146)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (130 <= main_~j~5 && main_~i~5 <= 134)) || (155 <= main_~j~5 && main_~i~5 <= 159)) || (182 <= main_~j~5 && main_~i~5 <= 186)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || 190 <= main_~j~5) || (main_~i~5 <= 163 && 159 <= main_~j~5)) || (main_~i~5 <= 180 && 176 <= main_~j~5)) || (139 <= main_~j~5 && main_~i~5 <= 143)) || (173 <= main_~j~5 && main_~i~5 <= 177)) || (main_~i~5 <= 145 && 141 <= main_~j~5)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 118 && 114 <= main_~j~5)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (112 <= main_~j~5 && main_~i~5 <= 116)) || (180 <= main_~j~5 && main_~i~5 <= 184)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (123 <= main_~j~5 && main_~i~5 <= 127)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (153 <= main_~j~5 && main_~i~5 <= 157)) || (184 <= main_~j~5 && main_~i~5 <= 188)) || (111 <= main_~j~5 && main_~i~5 <= 115)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 131 && 127 <= main_~j~5)) || (main_~i~5 <= 123 && 119 <= main_~j~5)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (105 <= main_~j~5 && main_~i~5 <= 109)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (169 <= main_~j~5 && main_~i~5 <= 173)) || (main_~i~5 <= 139 && 135 <= main_~j~5)) || (162 <= main_~j~5 && main_~i~5 <= 166)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (main_~i~5 <= 181 && 177 <= main_~j~5)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (main_~i~5 <= 101 && 97 <= main_~j~5)) || (101 <= main_~j~5 && main_~i~5 <= 105)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (81 <= main_~j~5 && main_~i~5 <= 81)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (158 <= main_~j~5 && main_~i~5 <= 162)) || (154 <= main_~j~5 && main_~i~5 <= 158)) || (124 <= main_~j~5 && main_~i~5 <= 128)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (129 <= main_~j~5 && main_~i~5 <= 133)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (main_~i~5 <= 113 && 109 <= main_~j~5)) || (main_~i~5 <= 151 && 147 <= main_~j~5)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (main_~i~5 <= 148 && 144 <= main_~j~5)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (163 <= main_~j~5 && main_~i~5 <= 167)) || (main_~i~5 <= 161 && 157 <= main_~j~5)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 192 && 188 <= main_~j~5)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (133 <= main_~j~5 && main_~i~5 <= 137)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || (main_~i~5 <= 120 && 116 <= main_~j~5)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (134 <= main_~j~5 && main_~i~5 <= 138)) || (151 <= main_~j~5 && main_~i~5 <= 155)) || (143 <= main_~j~5 && main_~i~5 <= 147)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 124 && 120 <= main_~j~5)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (main_~i~5 <= 156 && 152 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (main_~i~5 <= 110 && 106 <= main_~j~5)) || (122 <= main_~j~5 && main_~i~5 <= 126)) || (main_~i~5 <= 132 && 128 <= main_~j~5)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (149 <= main_~j~5 && main_~i~5 <= 153) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 78.4s OverallTime, 8 OverallIterations, 191 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 13.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 0 SDslu, 685 SDs, 0 SdLazy, 883 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1127 GetRequests, 386 SyntacticMatches, 89 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4450 ImplicationChecksByTransitivity, 56.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 383 NumberOfFragments, 2669 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 528 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 1144 NumberOfCodeBlocks, 1144 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1502 ConstructedInterpolants, 0 QuantifiedInterpolants, 872600 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1542 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 36290/71480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...