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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:45:03,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:45:03,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:45:03,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:45:03,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:45:03,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:45:03,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:45:03,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:45:03,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:45:03,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:45:03,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:45:03,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:45:03,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:45:03,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:45:03,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:45:03,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:45:03,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:45:03,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:45:03,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:45:03,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:45:03,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:45:03,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:45:03,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:45:03,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:45:03,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:45:03,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:45:03,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:45:03,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:45:03,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:45:03,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:45:03,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:45:03,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:45:03,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:45:03,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:45:03,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:45:03,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:45:03,852 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 [2019-02-15 10:45:03,873 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:45:03,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:45:03,874 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:45:03,874 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:45:03,874 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:45:03,875 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:45:03,875 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:45:03,875 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:45:03,875 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:45:03,875 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:45:03,876 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:45:03,876 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:45:03,876 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:45:03,876 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:45:03,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:45:03,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:45:03,877 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:45:03,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:45:03,879 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:45:03,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:45:03,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:45:03,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:45:03,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:45:03,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:45:03,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:45:03,880 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:45:03,881 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:45:03,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:45:03,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:45:03,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:45:03,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:45:03,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:45:03,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:45:03,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:45:03,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:45:03,883 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:45:03,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:45:03,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:45:03,883 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:45:03,883 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:45:03,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:45:03,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:45:03,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:45:03,947 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:45:03,948 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:45:03,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-02-15 10:45:03,949 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-15 10:45:03,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:45:03,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:45:03,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:45:03,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:45:03,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:45:04,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,029 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 10:45:04,030 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 10:45:04,030 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 10:45:04,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:45:04,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:45:04,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:45:04,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:45:04,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:04,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:45:04,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:45:04,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:45:04,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:45:04,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (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 [2019-02-15 10:45:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 10:45:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 10:45:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-15 10:45:04,412 INFO L278 CfgBuilder]: Using library mode [2019-02-15 10:45:04,412 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-15 10:45:04,414 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:04 BoogieIcfgContainer [2019-02-15 10:45:04,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:45:04,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:45:04,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:45:04,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:45:04,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/2) ... [2019-02-15 10:45:04,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee76070 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:04, skipping insertion in model container [2019-02-15 10:45:04,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:04" (2/2) ... [2019-02-15 10:45:04,431 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-15 10:45:04,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:45:04,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:45:04,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:45:04,540 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:45:04,540 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:45:04,540 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:45:04,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:45:04,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:45:04,541 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:45:04,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:45:04,541 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:45:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-15 10:45:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:45:04,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:45:04,569 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-15 10:45:04,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:04,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:45:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:45:04,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:45:04,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:45:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:45:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:45:04,821 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-15 10:45:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,919 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-15 10:45:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:45:04,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:45:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,934 INFO L225 Difference]: With dead ends: 17 [2019-02-15 10:45:04,934 INFO L226 Difference]: Without dead ends: 10 [2019-02-15 10:45:04,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:45:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-15 10:45:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-15 10:45:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 10:45:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-15 10:45:04,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-15 10:45:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,970 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-15 10:45:04,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:45:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-15 10:45:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:45:04,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-15 10:45:04,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-15 10:45:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 10:45:05,064 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-15 10:45:05,104 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:45:05,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:45:05,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:45:05,221 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 5 different actions 10 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:45:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:45:05,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,229 INFO L193 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 [2019-02-15 10:45:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:05,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:05,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:45:05,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:05,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:45:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:45:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:45:05,681 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-15 10:45:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:05,796 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-15 10:45:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:45:05,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-15 10:45:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:05,797 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:45:05,797 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 10:45:05,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:45:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 10:45:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-15 10:45:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:45:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-15 10:45:05,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-15 10:45:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:05,803 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-15 10:45:05,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:45:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-15 10:45:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 10:45:05,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:05,804 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-15 10:45:05,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-15 10:45:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,032 INFO L193 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 [2019-02-15 10:45:06,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:06,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:06,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:45:06,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:06,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:06,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:45:06,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:06,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:45:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:45:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:06,437 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-15 10:45:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:06,568 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-15 10:45:06,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:45:06,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-15 10:45:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:06,571 INFO L225 Difference]: With dead ends: 19 [2019-02-15 10:45:06,571 INFO L226 Difference]: Without dead ends: 18 [2019-02-15 10:45:06,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-15 10:45:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-15 10:45:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:45:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-15 10:45:06,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-15 10:45:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:06,577 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-15 10:45:06,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:45:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-15 10:45:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 10:45:06,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:06,578 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-15 10:45:06,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-15 10:45:06,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,732 INFO L193 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 [2019-02-15 10:45:06,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:06,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:06,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:06,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:06,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:06,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:45:07,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:07,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:45:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:45:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:07,020 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-15 10:45:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,400 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-15 10:45:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:45:07,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-15 10:45:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,402 INFO L225 Difference]: With dead ends: 23 [2019-02-15 10:45:07,402 INFO L226 Difference]: Without dead ends: 22 [2019-02-15 10:45:07,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-15 10:45:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-15 10:45:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:45:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-15 10:45:07,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-15 10:45:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,406 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-15 10:45:07,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:45:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-15 10:45:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 10:45:07,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,408 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-15 10:45:07,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-15 10:45:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:07,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:07,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:07,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,547 INFO L193 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 [2019-02-15 10:45:07,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:07,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:07,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:07,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:07,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:07,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:45:07,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:07,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:45:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:45:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:07,908 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-15 10:45:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,979 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-15 10:45:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:45:07,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-15 10:45:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,981 INFO L225 Difference]: With dead ends: 27 [2019-02-15 10:45:07,981 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 10:45:07,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 10:45:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-15 10:45:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:45:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-15 10:45:07,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-15 10:45:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,986 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-15 10:45:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:45:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-15 10:45:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 10:45:07,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,988 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-15 10:45:07,988 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-15 10:45:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,192 INFO L193 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 [2019-02-15 10:45:08,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:08,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:08,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 10:45:08,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:08,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:08,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:45:08,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:45:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:45:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:45:08,555 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-15 10:45:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:08,615 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-15 10:45:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:45:08,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-15 10:45:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:08,617 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:45:08,617 INFO L226 Difference]: Without dead ends: 30 [2019-02-15 10:45:08,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:45:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-15 10:45:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-15 10:45:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:45:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-15 10:45:08,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-15 10:45:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:08,623 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-15 10:45:08,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:45:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-15 10:45:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 10:45:08,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:08,624 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-15 10:45:08,625 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-15 10:45:08,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:08,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:08,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,747 INFO L193 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 [2019-02-15 10:45:08,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:08,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:08,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:08,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:08,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:08,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-15 10:45:09,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 10:45:09,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 10:45:09,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:09,067 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-15 10:45:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:09,145 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-15 10:45:09,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:45:09,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-15 10:45:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:09,148 INFO L225 Difference]: With dead ends: 35 [2019-02-15 10:45:09,148 INFO L226 Difference]: Without dead ends: 34 [2019-02-15 10:45:09,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-15 10:45:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-15 10:45:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:45:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-15 10:45:09,153 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-15 10:45:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:09,154 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-15 10:45:09,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 10:45:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-15 10:45:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 10:45:09,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:09,155 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-15 10:45:09,155 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-15 10:45:09,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:09,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:09,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:09,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:09,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:09,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:09,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:09,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-15 10:45:09,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 10:45:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 10:45:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:09,737 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-15 10:45:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:09,998 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-15 10:45:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:45:09,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-15 10:45:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,001 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:45:10,001 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:45:10,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:45:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-15 10:45:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:45:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-15 10:45:10,006 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-15 10:45:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,007 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-15 10:45:10,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 10:45:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-15 10:45:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 10:45:10,008 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,008 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-15 10:45:10,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-15 10:45:10,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:10,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:10,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:10,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:10,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:10,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:10,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 10:45:10,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:10,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:10,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:10,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:10,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:10,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-15 10:45:10,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:10,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 10:45:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 10:45:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:10,766 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-15 10:45:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:10,868 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-15 10:45:10,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:45:10,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-15 10:45:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,870 INFO L225 Difference]: With dead ends: 43 [2019-02-15 10:45:10,870 INFO L226 Difference]: Without dead ends: 42 [2019-02-15 10:45:10,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-15 10:45:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-15 10:45:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:45:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-15 10:45:10,876 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-15 10:45:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,877 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-15 10:45:10,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 10:45:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-15 10:45:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 10:45:10,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,878 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-15 10:45:10,878 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-15 10:45:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:11,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:11,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:11,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:11,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:11,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:11,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:11,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:11,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:11,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:11,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-15 10:45:11,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:11,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 10:45:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 10:45:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:11,728 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-15 10:45:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:11,841 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-15 10:45:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:45:11,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-15 10:45:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:11,842 INFO L225 Difference]: With dead ends: 47 [2019-02-15 10:45:11,842 INFO L226 Difference]: Without dead ends: 46 [2019-02-15 10:45:11,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-15 10:45:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-15 10:45:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:45:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-15 10:45:11,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-15 10:45:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:11,848 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-15 10:45:11,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 10:45:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-15 10:45:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 10:45:11,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:11,850 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-15 10:45:11,850 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-15 10:45:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:12,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:12,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:12,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:12,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:12,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:12,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:12,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:12,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:12,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-15 10:45:12,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:12,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 10:45:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 10:45:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 10:45:12,765 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-15 10:45:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:12,843 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-15 10:45:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:45:12,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-15 10:45:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:12,845 INFO L225 Difference]: With dead ends: 51 [2019-02-15 10:45:12,845 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:45:12,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 10:45:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:45:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-15 10:45:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 10:45:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-15 10:45:12,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-15 10:45:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:12,852 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-15 10:45:12,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 10:45:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-15 10:45:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 10:45:12,853 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:12,853 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-15 10:45:12,853 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-15 10:45:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:13,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:13,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:13,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:13,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:13,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:13,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-15 10:45:13,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:13,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:13,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:13,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:13,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:13,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:13,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-15 10:45:13,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:13,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:13,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:13,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:13,657 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-15 10:45:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,745 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-15 10:45:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 10:45:13,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-15 10:45:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,747 INFO L225 Difference]: With dead ends: 55 [2019-02-15 10:45:13,747 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 10:45:13,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 10:45:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-15 10:45:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 10:45:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-15 10:45:13,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-15 10:45:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,754 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-15 10:45:13,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-15 10:45:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 10:45:13,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,755 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-15 10:45:13,756 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-15 10:45:13,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:13,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:14,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:14,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:14,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:14,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:14,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-15 10:45:14,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:14,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 10:45:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 10:45:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 10:45:14,969 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-15 10:45:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:15,092 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-15 10:45:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:45:15,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-15 10:45:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:15,094 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:45:15,094 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:45:15,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 10:45:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:45:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-15 10:45:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 10:45:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-15 10:45:15,101 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-15 10:45:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:15,102 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-15 10:45:15,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 10:45:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-15 10:45:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 10:45:15,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:15,103 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-15 10:45:15,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-15 10:45:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:15,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:15,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:15,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:15,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:15,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:15,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:15,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:15,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:15,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:15,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:15,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:15,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-15 10:45:16,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:16,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 10:45:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 10:45:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:16,784 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-15 10:45:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:17,078 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-15 10:45:17,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:45:17,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-15 10:45:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:17,079 INFO L225 Difference]: With dead ends: 63 [2019-02-15 10:45:17,080 INFO L226 Difference]: Without dead ends: 62 [2019-02-15 10:45:17,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-15 10:45:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-15 10:45:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:45:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-15 10:45:17,086 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-15 10:45:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:17,087 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-15 10:45:17,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 10:45:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-15 10:45:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 10:45:17,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:17,088 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-15 10:45:17,088 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-15 10:45:17,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:17,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:17,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:17,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:17,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:17,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:17,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:17,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:17,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 10:45:17,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:17,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:17,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:17,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:17,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:17,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:18,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-15 10:45:18,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:18,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:18,838 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-15 10:45:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:19,048 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-15 10:45:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 10:45:19,048 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-15 10:45:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:19,049 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:45:19,049 INFO L226 Difference]: Without dead ends: 66 [2019-02-15 10:45:19,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-15 10:45:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-15 10:45:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 10:45:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-15 10:45:19,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-15 10:45:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:19,058 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-15 10:45:19,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-15 10:45:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 10:45:19,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:19,060 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-15 10:45:19,060 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-15 10:45:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:19,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:19,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:19,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:19,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:19,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:19,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:19,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:19,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:19,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:19,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:19,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:19,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:19,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:20,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-15 10:45:20,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:20,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 10:45:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 10:45:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:20,428 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-15 10:45:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:20,559 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-15 10:45:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:45:20,560 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-15 10:45:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:20,561 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:45:20,561 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 10:45:20,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 10:45:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-15 10:45:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 10:45:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-15 10:45:20,568 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-15 10:45:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:20,568 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-15 10:45:20,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 10:45:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-15 10:45:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 10:45:20,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:20,569 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-15 10:45:20,569 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-15 10:45:20,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:20,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:20,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:20,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:20,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:20,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:20,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:20,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:20,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:22,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:22,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-15 10:45:22,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:22,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 10:45:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 10:45:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:45:22,928 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-15 10:45:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:23,037 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-15 10:45:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:23,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-15 10:45:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:23,039 INFO L225 Difference]: With dead ends: 75 [2019-02-15 10:45:23,039 INFO L226 Difference]: Without dead ends: 74 [2019-02-15 10:45:23,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:45:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-15 10:45:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-15 10:45:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:45:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-15 10:45:23,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-15 10:45:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-15 10:45:23,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 10:45:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-15 10:45:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 10:45:23,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:23,047 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-15 10:45:23,047 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-15 10:45:23,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:23,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:23,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:23,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:23,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:23,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:23,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:23,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:23,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 10:45:23,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:23,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:23,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:23,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:23,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:23,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:23,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:24,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-15 10:45:24,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:24,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:24,264 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-15 10:45:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:24,385 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-15 10:45:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:24,386 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-15 10:45:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:24,387 INFO L225 Difference]: With dead ends: 79 [2019-02-15 10:45:24,387 INFO L226 Difference]: Without dead ends: 78 [2019-02-15 10:45:24,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-15 10:45:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-15 10:45:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:45:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-15 10:45:24,392 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-15 10:45:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:24,393 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-15 10:45:24,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-15 10:45:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 10:45:24,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:24,394 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-15 10:45:24,394 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-15 10:45:24,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:24,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:24,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:24,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:24,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:24,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:24,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:24,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:24,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:24,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:24,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:24,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:25,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:25,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:25,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-15 10:45:25,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:25,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 10:45:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 10:45:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:45:25,781 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-15 10:45:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:25,952 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-15 10:45:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 10:45:25,953 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-15 10:45:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:25,954 INFO L225 Difference]: With dead ends: 83 [2019-02-15 10:45:25,954 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 10:45:25,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:45:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 10:45:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-15 10:45:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 10:45:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-15 10:45:25,959 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-15 10:45:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:25,960 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-15 10:45:25,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 10:45:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-15 10:45:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 10:45:25,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:25,961 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-15 10:45:25,961 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:25,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-15 10:45:25,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:25,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:25,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:26,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:26,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:26,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:26,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:26,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:26,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:26,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:26,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:26,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:26,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:26,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:26,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:27,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:27,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-15 10:45:27,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:27,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 10:45:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 10:45:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:27,653 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-15 10:45:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:27,789 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-15 10:45:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:27,789 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-15 10:45:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:27,791 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:45:27,791 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 10:45:27,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 10:45:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-15 10:45:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 10:45:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-15 10:45:27,797 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-15 10:45:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:27,797 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-15 10:45:27,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 10:45:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-15 10:45:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 10:45:27,798 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:27,798 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-15 10:45:27,798 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-15 10:45:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:28,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:28,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:28,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:28,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:28,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:28,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:28,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:28,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:28,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-15 10:45:28,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:28,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:28,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:28,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:28,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:28,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:29,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:29,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:29,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-15 10:45:29,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:45:29,683 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-15 10:45:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:29,855 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-15 10:45:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 10:45:29,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-15 10:45:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:29,857 INFO L225 Difference]: With dead ends: 91 [2019-02-15 10:45:29,857 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 10:45:29,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:45:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 10:45:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-15 10:45:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 10:45:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-15 10:45:29,861 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-15 10:45:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-15 10:45:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-15 10:45:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 10:45:29,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:29,862 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-15 10:45:29,863 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-15 10:45:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:29,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:29,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:30,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:30,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:30,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:30,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:30,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:30,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:30,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:30,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:30,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:30,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:30,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:30,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:30,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:30,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:30,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:31,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-15 10:45:31,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:31,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 10:45:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 10:45:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:31,450 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-15 10:45:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:31,645 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-15 10:45:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:45:31,646 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-15 10:45:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:31,648 INFO L225 Difference]: With dead ends: 95 [2019-02-15 10:45:31,648 INFO L226 Difference]: Without dead ends: 94 [2019-02-15 10:45:31,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-15 10:45:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-15 10:45:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 10:45:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-15 10:45:31,652 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-15 10:45:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:31,653 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-15 10:45:31,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 10:45:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-15 10:45:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 10:45:31,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:31,654 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-15 10:45:31,654 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:31,654 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-15 10:45:31,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:32,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:32,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:32,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:32,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:32,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:32,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:32,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:32,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:32,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:32,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:32,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-15 10:45:33,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:33,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 10:45:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 10:45:33,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:45:33,477 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-15 10:45:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:33,626 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-15 10:45:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 10:45:33,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-15 10:45:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:33,629 INFO L225 Difference]: With dead ends: 99 [2019-02-15 10:45:33,629 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 10:45:33,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:45:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 10:45:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-15 10:45:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:45:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-15 10:45:33,634 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-15 10:45:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:33,634 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-15 10:45:33,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 10:45:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-15 10:45:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 10:45:33,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:33,635 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-15 10:45:33,635 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-15 10:45:33,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:33,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:33,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:34,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:34,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:34,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:34,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:34,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:34,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:34,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:34,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 10:45:34,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:34,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:34,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:34,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:34,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:34,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:34,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:35,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:35,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-15 10:45:35,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:35,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:45:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:45:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:35,596 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-15 10:45:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:35,797 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-15 10:45:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:35,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-15 10:45:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:35,803 INFO L225 Difference]: With dead ends: 103 [2019-02-15 10:45:35,803 INFO L226 Difference]: Without dead ends: 102 [2019-02-15 10:45:35,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-15 10:45:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-15 10:45:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 10:45:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-15 10:45:35,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-15 10:45:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:35,810 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-15 10:45:35,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:45:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-15 10:45:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 10:45:35,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:35,810 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-15 10:45:35,811 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-15 10:45:35,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:36,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:36,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:36,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:36,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:36,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:36,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:36,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:36,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:36,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:36,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:36,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:36,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:36,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:37,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:37,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-15 10:45:37,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:37,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 10:45:37,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 10:45:37,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:45:37,921 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-15 10:45:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:38,111 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-15 10:45:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:38,111 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-15 10:45:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:38,112 INFO L225 Difference]: With dead ends: 107 [2019-02-15 10:45:38,112 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 10:45:38,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:45:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 10:45:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-15 10:45:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 10:45:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-15 10:45:38,118 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-15 10:45:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:38,118 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-15 10:45:38,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 10:45:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-15 10:45:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 10:45:38,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:38,119 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-15 10:45:38,119 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-15 10:45:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:39,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:39,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:39,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:39,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:39,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:39,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:39,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:39,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:39,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:39,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:39,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:39,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:40,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:40,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-15 10:45:40,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:40,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 10:45:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 10:45:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:40,725 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-15 10:45:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:40,929 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-15 10:45:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 10:45:40,930 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-15 10:45:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:40,931 INFO L225 Difference]: With dead ends: 111 [2019-02-15 10:45:40,931 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 10:45:40,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 10:45:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-15 10:45:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 10:45:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-15 10:45:40,936 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-15 10:45:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-15 10:45:40,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 10:45:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-15 10:45:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 10:45:40,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:40,937 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-15 10:45:40,937 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-15 10:45:40,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:41,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:41,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:41,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:41,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:41,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:41,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:41,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 10:45:41,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:41,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:41,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:41,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:42,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:43,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:43,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-15 10:45:43,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:43,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-15 10:45:43,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-15 10:45:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-15 10:45:43,396 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-15 10:45:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:43,583 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-15 10:45:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 10:45:43,584 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-15 10:45:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:43,585 INFO L225 Difference]: With dead ends: 115 [2019-02-15 10:45:43,585 INFO L226 Difference]: Without dead ends: 114 [2019-02-15 10:45:43,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-15 10:45:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-15 10:45:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-15 10:45:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 10:45:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-15 10:45:43,591 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-15 10:45:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:43,591 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-15 10:45:43,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-15 10:45:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-15 10:45:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-15 10:45:43,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:43,591 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-15 10:45:43,592 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-15 10:45:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:43,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:43,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:44,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:44,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:44,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:44,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:44,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:44,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:44,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:44,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:44,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:44,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:44,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:44,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:44,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:46,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:46,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-15 10:45:46,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 10:45:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 10:45:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:46,060 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-15 10:45:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:46,251 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-15 10:45:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:45:46,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-15 10:45:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:46,252 INFO L225 Difference]: With dead ends: 119 [2019-02-15 10:45:46,252 INFO L226 Difference]: Without dead ends: 118 [2019-02-15 10:45:46,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-15 10:45:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-15 10:45:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 10:45:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-15 10:45:46,257 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-15 10:45:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-15 10:45:46,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 10:45:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-15 10:45:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-15 10:45:46,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:46,258 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-15 10:45:46,258 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-15 10:45:46,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:46,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:46,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:46,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:46,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:46,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:46,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:46,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:46,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:46,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:46,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:46,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:46,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:47,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:49,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:49,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-15 10:45:49,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:49,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-15 10:45:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-15 10:45:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:45:49,023 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-15 10:45:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:49,241 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-15 10:45:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:45:49,241 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-15 10:45:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:49,243 INFO L225 Difference]: With dead ends: 123 [2019-02-15 10:45:49,243 INFO L226 Difference]: Without dead ends: 122 [2019-02-15 10:45:49,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:45:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-15 10:45:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-15 10:45:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:45:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-15 10:45:49,249 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-15 10:45:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:49,250 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-15 10:45:49,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-15 10:45:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-15 10:45:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-15 10:45:49,251 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:49,251 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-15 10:45:49,251 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-15 10:45:49,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:49,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:49,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:49,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:49,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:49,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:49,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:49,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:49,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 10:45:49,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:49,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:49,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:49,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:50,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:51,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-15 10:45:51,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:51,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-15 10:45:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-15 10:45:51,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:45:51,921 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-15 10:45:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:52,136 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-15 10:45:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:45:52,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-15 10:45:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:52,138 INFO L225 Difference]: With dead ends: 127 [2019-02-15 10:45:52,138 INFO L226 Difference]: Without dead ends: 126 [2019-02-15 10:45:52,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:45:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-15 10:45:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-15 10:45:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-15 10:45:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-15 10:45:52,143 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-15 10:45:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:52,143 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-15 10:45:52,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-15 10:45:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-15 10:45:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-15 10:45:52,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:52,144 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-15 10:45:52,144 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-15 10:45:52,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:52,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:52,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:53,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:53,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:53,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:53,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:53,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:53,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:53,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:53,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:53,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:53,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:53,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:53,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:53,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:53,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:55,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:55,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-15 10:45:55,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:55,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 10:45:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 10:45:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:45:55,220 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-15 10:45:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:55,473 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-15 10:45:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 10:45:55,473 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-15 10:45:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:55,475 INFO L225 Difference]: With dead ends: 131 [2019-02-15 10:45:55,475 INFO L226 Difference]: Without dead ends: 130 [2019-02-15 10:45:55,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:45:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-15 10:45:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-15 10:45:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-15 10:45:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-15 10:45:55,480 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-15 10:45:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:55,481 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-15 10:45:55,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 10:45:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-15 10:45:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-15 10:45:55,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:55,482 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-15 10:45:55,482 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-15 10:45:55,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:56,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:56,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:56,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:56,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:56,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:56,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:56,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:56,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:56,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:56,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:57,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-15 10:45:59,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:59,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-15 10:45:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-15 10:45:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:45:59,082 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-15 10:45:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:59,314 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-15 10:45:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:45:59,315 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-15 10:45:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:59,316 INFO L225 Difference]: With dead ends: 135 [2019-02-15 10:45:59,317 INFO L226 Difference]: Without dead ends: 134 [2019-02-15 10:45:59,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:45:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-15 10:45:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-15 10:45:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:45:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-15 10:45:59,323 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-15 10:45:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:59,323 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-15 10:45:59,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-15 10:45:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-15 10:45:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 10:45:59,324 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:59,324 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-15 10:45:59,324 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-15 10:45:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:00,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:00,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:00,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:00,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:00,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:00,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:00,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-15 10:46:00,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:00,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:00,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:00,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:00,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:00,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:01,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:02,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-15 10:46:02,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:02,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-15 10:46:02,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-15 10:46:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:46:02,711 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-15 10:46:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:02,945 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-15 10:46:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:46:02,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-15 10:46:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:02,947 INFO L225 Difference]: With dead ends: 139 [2019-02-15 10:46:02,947 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 10:46:02,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:46:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 10:46:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-15 10:46:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 10:46:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-15 10:46:02,952 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-15 10:46:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:02,953 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-15 10:46:02,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-15 10:46:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-15 10:46:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-15 10:46:02,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:02,954 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-15 10:46:02,954 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-15 10:46:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:02,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:02,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:03,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:03,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:03,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:03,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:03,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:03,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:03,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:03,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:03,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:03,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:03,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:03,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:05,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-15 10:46:06,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:06,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 10:46:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 10:46:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:06,664 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-15 10:46:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:06,969 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-15 10:46:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:46:06,969 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-15 10:46:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:06,971 INFO L225 Difference]: With dead ends: 143 [2019-02-15 10:46:06,971 INFO L226 Difference]: Without dead ends: 142 [2019-02-15 10:46:06,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-15 10:46:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-15 10:46:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-15 10:46:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-15 10:46:06,976 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-15 10:46:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:06,977 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-15 10:46:06,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 10:46:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-15 10:46:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-15 10:46:06,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:06,978 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-15 10:46:06,978 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-15 10:46:06,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:07,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:07,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:07,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:07,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:07,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:07,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:07,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:07,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:07,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:07,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:08,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-15 10:46:10,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:10,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-15 10:46:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-15 10:46:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:46:10,431 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-15 10:46:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:10,861 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-15 10:46:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:46:10,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-15 10:46:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:10,863 INFO L225 Difference]: With dead ends: 147 [2019-02-15 10:46:10,863 INFO L226 Difference]: Without dead ends: 146 [2019-02-15 10:46:10,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:46:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-15 10:46:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-15 10:46:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-15 10:46:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-15 10:46:10,869 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-15 10:46:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:10,869 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-15 10:46:10,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-15 10:46:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-15 10:46:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-15 10:46:10,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:10,870 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-15 10:46:10,871 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-15 10:46:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:11,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:11,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:11,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:11,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:11,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:11,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 10:46:11,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:11,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:11,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:11,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:11,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:11,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:12,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-15 10:46:14,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:14,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 10:46:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 10:46:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:14,501 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-15 10:46:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:15,017 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-15 10:46:15,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 10:46:15,018 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-15 10:46:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:15,022 INFO L225 Difference]: With dead ends: 151 [2019-02-15 10:46:15,022 INFO L226 Difference]: Without dead ends: 150 [2019-02-15 10:46:15,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-15 10:46:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-15 10:46:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 10:46:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-15 10:46:15,028 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-15 10:46:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:15,028 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-15 10:46:15,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 10:46:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-15 10:46:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-15 10:46:15,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:15,029 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-15 10:46:15,029 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:15,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-15 10:46:15,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:15,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:15,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:15,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:15,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:15,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:15,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:15,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:15,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:15,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:15,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:15,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:15,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:15,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:16,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:16,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:17,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-15 10:46:18,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:18,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 10:46:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 10:46:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:46:18,989 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-15 10:46:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:19,327 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-15 10:46:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:46:19,328 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-15 10:46:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:19,329 INFO L225 Difference]: With dead ends: 155 [2019-02-15 10:46:19,330 INFO L226 Difference]: Without dead ends: 154 [2019-02-15 10:46:19,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:46:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-15 10:46:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-15 10:46:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-15 10:46:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-15 10:46:19,336 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-15 10:46:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:19,336 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-15 10:46:19,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 10:46:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-15 10:46:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-15 10:46:19,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:19,338 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-15 10:46:19,338 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-15 10:46:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:20,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:20,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:20,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:20,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:20,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:20,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:22,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:24,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:24,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-15 10:46:24,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:24,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-15 10:46:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-15 10:46:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:46:24,224 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-15 10:46:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:24,503 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-15 10:46:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:46:24,504 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-15 10:46:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:24,505 INFO L225 Difference]: With dead ends: 159 [2019-02-15 10:46:24,505 INFO L226 Difference]: Without dead ends: 158 [2019-02-15 10:46:24,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:46:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-15 10:46:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-15 10:46:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 10:46:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-15 10:46:24,511 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-15 10:46:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:24,511 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-15 10:46:24,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-15 10:46:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-15 10:46:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 10:46:24,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:24,513 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-15 10:46:24,513 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-15 10:46:24,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:24,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:24,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:25,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:25,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:25,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:25,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:25,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-15 10:46:25,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:25,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:25,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:25,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:25,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:25,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:26,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:28,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:28,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-15 10:46:28,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:28,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 10:46:28,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 10:46:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:46:28,898 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-15 10:46:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:29,224 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-15 10:46:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 10:46:29,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-15 10:46:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:29,226 INFO L225 Difference]: With dead ends: 163 [2019-02-15 10:46:29,226 INFO L226 Difference]: Without dead ends: 162 [2019-02-15 10:46:29,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:46:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-15 10:46:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-15 10:46:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-15 10:46:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-15 10:46:29,233 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-15 10:46:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:29,233 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-15 10:46:29,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 10:46:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-15 10:46:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-15 10:46:29,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:29,234 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-15 10:46:29,234 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-15 10:46:29,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:29,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:29,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:30,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:30,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:30,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:30,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:30,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:30,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:30,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:30,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:30,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:30,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:30,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:30,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:30,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:30,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:30,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:31,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:33,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:33,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-15 10:46:33,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:33,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 10:46:33,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 10:46:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:46:33,408 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-15 10:46:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:33,976 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-15 10:46:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 10:46:33,977 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-15 10:46:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:33,978 INFO L225 Difference]: With dead ends: 167 [2019-02-15 10:46:33,978 INFO L226 Difference]: Without dead ends: 166 [2019-02-15 10:46:33,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:46:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-15 10:46:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-15 10:46:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-15 10:46:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-15 10:46:33,984 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-15 10:46:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:33,984 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-15 10:46:33,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 10:46:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-15 10:46:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-15 10:46:33,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:33,985 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-15 10:46:33,986 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-15 10:46:33,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:35,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:35,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:35,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:35,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:35,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:35,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:35,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:35,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:35,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:35,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:35,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:35,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:35,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:36,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:39,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:39,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-15 10:46:39,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:39,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-15 10:46:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-15 10:46:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 10:46:39,191 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-15 10:46:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:39,467 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-15 10:46:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 10:46:39,468 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-15 10:46:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:39,469 INFO L225 Difference]: With dead ends: 171 [2019-02-15 10:46:39,469 INFO L226 Difference]: Without dead ends: 170 [2019-02-15 10:46:39,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 10:46:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-15 10:46:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-15 10:46:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-15 10:46:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-15 10:46:39,475 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-15 10:46:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:39,475 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-15 10:46:39,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-15 10:46:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-15 10:46:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-15 10:46:39,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:39,477 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-15 10:46:39,477 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-15 10:46:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:39,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:40,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:40,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:40,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:40,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:40,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:40,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:40,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:40,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-15 10:46:40,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:40,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:40,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:40,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:40,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:40,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:41,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:44,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:44,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-15 10:46:44,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:44,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 10:46:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 10:46:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:46:44,078 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-15 10:46:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:44,396 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-15 10:46:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:46:44,396 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-15 10:46:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:44,398 INFO L225 Difference]: With dead ends: 175 [2019-02-15 10:46:44,398 INFO L226 Difference]: Without dead ends: 174 [2019-02-15 10:46:44,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:46:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-15 10:46:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-15 10:46:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-15 10:46:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-15 10:46:44,404 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-15 10:46:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:44,404 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-15 10:46:44,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 10:46:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-15 10:46:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-15 10:46:44,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:44,406 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-15 10:46:44,406 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:44,406 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-15 10:46:44,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:44,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:44,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:44,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:44,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:45,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:45,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:45,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:45,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:45,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:45,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:45,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:45,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:45,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:45,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:45,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:45,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:45,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:45,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:45,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:47,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-15 10:46:49,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:49,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 10:46:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 10:46:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-15 10:46:49,605 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-15 10:46:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:50,178 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-15 10:46:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 10:46:50,179 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-15 10:46:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:50,180 INFO L225 Difference]: With dead ends: 179 [2019-02-15 10:46:50,180 INFO L226 Difference]: Without dead ends: 178 [2019-02-15 10:46:50,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-15 10:46:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-15 10:46:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-15 10:46:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-15 10:46:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-15 10:46:50,187 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-15 10:46:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:50,188 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-15 10:46:50,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 10:46:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-15 10:46:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-15 10:46:50,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:50,189 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-15 10:46:50,189 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-15 10:46:50,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:50,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:50,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:51,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:51,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:51,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:51,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:51,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:51,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:51,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:52,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-15 10:46:55,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:55,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-15 10:46:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-15 10:46:55,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:46:55,335 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-15 10:46:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:55,634 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-15 10:46:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 10:46:55,634 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-15 10:46:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:55,636 INFO L225 Difference]: With dead ends: 183 [2019-02-15 10:46:55,636 INFO L226 Difference]: Without dead ends: 182 [2019-02-15 10:46:55,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:46:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-15 10:46:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-15 10:46:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 10:46:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-15 10:46:55,642 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-15 10:46:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:55,643 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-15 10:46:55,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-15 10:46:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-15 10:46:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-15 10:46:55,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:55,644 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-15 10:46:55,644 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-15 10:46:55,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:55,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:57,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:57,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:57,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:57,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:57,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:57,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:57,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-15 10:46:57,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:57,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:57,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:57,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:57,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:57,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:58,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:01,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:01,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-15 10:47:01,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:01,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 10:47:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 10:47:01,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-15 10:47:01,579 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-15 10:47:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:01,945 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-15 10:47:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:47:01,945 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-15 10:47:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:01,946 INFO L225 Difference]: With dead ends: 187 [2019-02-15 10:47:01,946 INFO L226 Difference]: Without dead ends: 186 [2019-02-15 10:47:01,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-15 10:47:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-15 10:47:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-15 10:47:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 10:47:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-15 10:47:01,951 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-15 10:47:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:01,951 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-15 10:47:01,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 10:47:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-15 10:47:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-15 10:47:01,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:01,953 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-15 10:47:01,953 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:01,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-15 10:47:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:03,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:03,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:03,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:03,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:03,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:03,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:03,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:03,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:03,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:03,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:03,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:03,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:04,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:07,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:07,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-15 10:47:07,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:07,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 10:47:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 10:47:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:47:07,720 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-15 10:47:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:08,056 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-15 10:47:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:47:08,057 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-15 10:47:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:08,058 INFO L225 Difference]: With dead ends: 191 [2019-02-15 10:47:08,058 INFO L226 Difference]: Without dead ends: 190 [2019-02-15 10:47:08,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:47:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-15 10:47:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-15 10:47:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 10:47:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-15 10:47:08,064 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-15 10:47:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:08,064 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-15 10:47:08,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 10:47:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-15 10:47:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-15 10:47:08,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:08,065 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-15 10:47:08,065 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-15 10:47:08,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:09,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:09,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:09,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:09,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:10,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:10,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:10,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:12,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:15,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:15,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-15 10:47:15,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:15,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-15 10:47:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-15 10:47:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-15 10:47:15,831 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-15 10:47:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:16,192 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-15 10:47:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 10:47:16,193 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-15 10:47:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:16,194 INFO L225 Difference]: With dead ends: 195 [2019-02-15 10:47:16,194 INFO L226 Difference]: Without dead ends: 194 [2019-02-15 10:47:16,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-15 10:47:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-15 10:47:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-15 10:47:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 10:47:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-15 10:47:16,202 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-15 10:47:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:16,203 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-15 10:47:16,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-15 10:47:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-15 10:47:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-15 10:47:16,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:16,203 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-15 10:47:16,204 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-15 10:47:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:16,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:16,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:16,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:18,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:18,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:18,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:18,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:18,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:18,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:18,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:18,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-15 10:47:18,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:18,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:18,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:18,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:18,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:18,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:20,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:23,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:23,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-15 10:47:23,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:23,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-15 10:47:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-15 10:47:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:47:23,081 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-15 10:47:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:23,450 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-15 10:47:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:47:23,451 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-15 10:47:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:23,451 INFO L225 Difference]: With dead ends: 199 [2019-02-15 10:47:23,452 INFO L226 Difference]: Without dead ends: 198 [2019-02-15 10:47:23,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:47:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-15 10:47:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-15 10:47:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-15 10:47:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-15 10:47:23,459 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-15 10:47:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:23,459 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-15 10:47:23,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-15 10:47:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-15 10:47:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-15 10:47:23,460 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:23,460 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-15 10:47:23,461 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-15 10:47:23,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:23,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:23,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:23,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:23,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:24,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:24,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:24,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:24,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:24,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:24,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:24,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:24,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:24,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:24,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:24,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:24,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:24,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:24,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:26,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:29,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:29,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-15 10:47:29,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:29,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 10:47:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 10:47:29,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-15 10:47:29,553 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-15 10:47:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:29,965 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-15 10:47:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 10:47:29,965 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-15 10:47:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:29,966 INFO L225 Difference]: With dead ends: 203 [2019-02-15 10:47:29,966 INFO L226 Difference]: Without dead ends: 202 [2019-02-15 10:47:29,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-15 10:47:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-15 10:47:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-15 10:47:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-15 10:47:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-15 10:47:29,972 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-15 10:47:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:29,972 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-15 10:47:29,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 10:47:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-15 10:47:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-15 10:47:29,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:29,973 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-15 10:47:29,974 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-15 10:47:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:29,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:29,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:31,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:31,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:31,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:31,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:31,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:31,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:31,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:31,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:31,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:31,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:31,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:33,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:36,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-15 10:47:36,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:36,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-15 10:47:36,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-15 10:47:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:47:36,824 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-15 10:47:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:37,172 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-15 10:47:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:47:37,172 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-15 10:47:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:37,174 INFO L225 Difference]: With dead ends: 207 [2019-02-15 10:47:37,174 INFO L226 Difference]: Without dead ends: 206 [2019-02-15 10:47:37,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:47:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-15 10:47:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-15 10:47:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-15 10:47:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-15 10:47:37,181 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-15 10:47:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:37,181 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-15 10:47:37,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-15 10:47:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-15 10:47:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-15 10:47:37,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:37,182 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-15 10:47:37,182 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-15 10:47:37,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:37,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:37,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:37,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:37,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:38,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:38,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:38,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:38,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:38,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:38,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:38,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:38,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:38,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-15 10:47:38,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:38,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:38,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:38,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:38,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:38,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:40,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-15 10:47:44,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:44,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-15 10:47:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-15 10:47:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-15 10:47:44,039 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-15 10:47:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:44,435 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-15 10:47:44,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 10:47:44,436 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-15 10:47:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:44,437 INFO L225 Difference]: With dead ends: 211 [2019-02-15 10:47:44,437 INFO L226 Difference]: Without dead ends: 210 [2019-02-15 10:47:44,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-15 10:47:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-15 10:47:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-15 10:47:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-15 10:47:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-15 10:47:44,443 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-15 10:47:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:44,444 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-15 10:47:44,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-15 10:47:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-15 10:47:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-15 10:47:44,445 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:44,445 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-15 10:47:44,445 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-15 10:47:44,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:44,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:44,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:46,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:46,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:46,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:46,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:46,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:46,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:46,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:46,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:46,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:46,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:46,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:46,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:46,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:46,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:46,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:49,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-15 10:47:53,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:53,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 10:47:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 10:47:53,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:47:53,389 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-15 10:47:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:53,832 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-15 10:47:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:47:53,833 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-15 10:47:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:53,835 INFO L225 Difference]: With dead ends: 215 [2019-02-15 10:47:53,835 INFO L226 Difference]: Without dead ends: 214 [2019-02-15 10:47:53,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:47:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-15 10:47:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-15 10:47:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 10:47:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-15 10:47:53,842 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-15 10:47:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:53,842 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-15 10:47:53,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 10:47:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-15 10:47:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-15 10:47:53,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:53,843 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-15 10:47:53,844 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-15 10:47:53,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:53,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:53,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:53,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:53,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:55,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:55,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:55,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:55,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:55,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:55,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:55,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:55,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:55,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:55,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:55,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:55,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:57,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:01,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:01,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-15 10:48:01,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:01,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-15 10:48:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-15 10:48:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 10:48:01,308 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-15 10:48:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:01,712 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-15 10:48:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:48:01,713 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-15 10:48:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:01,714 INFO L225 Difference]: With dead ends: 219 [2019-02-15 10:48:01,714 INFO L226 Difference]: Without dead ends: 218 [2019-02-15 10:48:01,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 10:48:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-15 10:48:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-15 10:48:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 10:48:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-15 10:48:01,720 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-15 10:48:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:01,720 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-15 10:48:01,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-15 10:48:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-15 10:48:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-15 10:48:01,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:01,722 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-15 10:48:01,722 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-15 10:48:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:01,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:01,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:03,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:03,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:03,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:03,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:03,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:03,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:03,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:03,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-15 10:48:03,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:03,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:03,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:03,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:03,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:03,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:05,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-15 10:48:09,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:09,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-15 10:48:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-15 10:48:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:48:09,006 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-15 10:48:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:09,443 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-15 10:48:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 10:48:09,445 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-15 10:48:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:09,446 INFO L225 Difference]: With dead ends: 223 [2019-02-15 10:48:09,446 INFO L226 Difference]: Without dead ends: 222 [2019-02-15 10:48:09,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:48:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-15 10:48:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-15 10:48:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 10:48:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-15 10:48:09,451 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-15 10:48:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:09,451 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-15 10:48:09,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-15 10:48:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-15 10:48:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-15 10:48:09,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:09,452 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-15 10:48:09,452 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-15 10:48:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:09,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:09,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:11,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:11,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:11,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:11,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:11,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:11,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:11,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:11,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:11,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:11,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:11,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:11,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:11,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:11,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:13,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:16,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:16,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-15 10:48:16,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:16,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-15 10:48:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-15 10:48:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:48:16,980 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-15 10:48:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:17,421 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-15 10:48:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 10:48:17,421 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-15 10:48:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:17,422 INFO L225 Difference]: With dead ends: 227 [2019-02-15 10:48:17,423 INFO L226 Difference]: Without dead ends: 226 [2019-02-15 10:48:17,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:48:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-15 10:48:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-15 10:48:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 10:48:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-15 10:48:17,429 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-15 10:48:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:17,430 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-15 10:48:17,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-15 10:48:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-15 10:48:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-15 10:48:17,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:17,431 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-15 10:48:17,431 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-15 10:48:17,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:17,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:17,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:18,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:18,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:18,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:18,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:18,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:18,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:18,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:18,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:19,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:19,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:19,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:19,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:19,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:20,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:24,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-15 10:48:24,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:24,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-15 10:48:24,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-15 10:48:24,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:48:24,696 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-15 10:48:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:25,188 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-15 10:48:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 10:48:25,189 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-15 10:48:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:25,191 INFO L225 Difference]: With dead ends: 231 [2019-02-15 10:48:25,191 INFO L226 Difference]: Without dead ends: 230 [2019-02-15 10:48:25,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:48:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-15 10:48:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-15 10:48:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-15 10:48:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-15 10:48:25,198 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-15 10:48:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:25,198 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-15 10:48:25,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-15 10:48:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-15 10:48:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-15 10:48:25,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:25,200 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-15 10:48:25,200 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-15 10:48:25,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:25,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:25,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:27,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:27,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:27,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:27,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:27,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:27,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:27,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:27,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-15 10:48:27,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:27,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:27,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:27,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:27,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:27,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:29,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:33,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-15 10:48:33,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:33,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-15 10:48:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-15 10:48:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-15 10:48:33,422 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-15 10:48:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:33,947 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-15 10:48:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 10:48:33,947 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-15 10:48:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:33,949 INFO L225 Difference]: With dead ends: 235 [2019-02-15 10:48:33,949 INFO L226 Difference]: Without dead ends: 234 [2019-02-15 10:48:33,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-15 10:48:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-15 10:48:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-15 10:48:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-15 10:48:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-15 10:48:33,956 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-15 10:48:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:33,957 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-15 10:48:33,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-15 10:48:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-15 10:48:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-15 10:48:33,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:33,958 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-15 10:48:33,958 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-15 10:48:33,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:33,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:33,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:35,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:35,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:35,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:35,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:35,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:35,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:35,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:35,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:35,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:35,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:35,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:35,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:35,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:35,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:35,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:38,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:42,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-15 10:48:42,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:42,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-15 10:48:42,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-15 10:48:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:48:42,244 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-15 10:48:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:42,747 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-15 10:48:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 10:48:42,748 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-15 10:48:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:42,750 INFO L225 Difference]: With dead ends: 239 [2019-02-15 10:48:42,750 INFO L226 Difference]: Without dead ends: 238 [2019-02-15 10:48:42,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:48:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-15 10:48:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-15 10:48:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-15 10:48:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-15 10:48:42,755 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-15 10:48:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:42,755 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-15 10:48:42,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-15 10:48:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-15 10:48:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-15 10:48:42,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:42,756 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-15 10:48:42,757 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-15 10:48:42,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:42,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:42,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:42,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:44,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:44,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:44,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:44,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:44,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:44,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:44,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:44,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:44,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:44,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:44,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:44,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:44,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:46,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:50,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:50,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-15 10:48:50,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:50,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-15 10:48:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-15 10:48:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-15 10:48:50,796 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-15 10:48:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:51,302 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-15 10:48:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 10:48:51,302 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-15 10:48:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:51,303 INFO L225 Difference]: With dead ends: 243 [2019-02-15 10:48:51,303 INFO L226 Difference]: Without dead ends: 242 [2019-02-15 10:48:51,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-15 10:48:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-15 10:48:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-15 10:48:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-15 10:48:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-15 10:48:51,308 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-15 10:48:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:51,309 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-15 10:48:51,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-15 10:48:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-15 10:48:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-15 10:48:51,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:51,310 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-15 10:48:51,310 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-15 10:48:51,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:51,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:53,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:53,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:53,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:53,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:53,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:53,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:53,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:53,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-15 10:48:53,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:53,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:53,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:53,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:53,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:53,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:55,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:59,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-15 10:48:59,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:59,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-15 10:48:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-15 10:48:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:48:59,906 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-15 10:49:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:00,383 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-15 10:49:00,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 10:49:00,384 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-15 10:49:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:00,385 INFO L225 Difference]: With dead ends: 247 [2019-02-15 10:49:00,385 INFO L226 Difference]: Without dead ends: 246 [2019-02-15 10:49:00,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:49:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-15 10:49:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-15 10:49:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-15 10:49:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-15 10:49:00,392 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-15 10:49:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:00,393 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-15 10:49:00,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-15 10:49:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-15 10:49:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-15 10:49:00,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:00,394 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-15 10:49:00,394 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-15 10:49:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:00,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:00,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:02,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:02,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:02,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:02,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:02,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:02,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:02,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:02,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:02,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:02,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:02,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:02,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:04,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:08,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:08,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-15 10:49:08,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:08,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-15 10:49:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-15 10:49:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:49:08,962 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-15 10:49:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:09,441 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-15 10:49:09,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 10:49:09,442 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-15 10:49:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:09,443 INFO L225 Difference]: With dead ends: 251 [2019-02-15 10:49:09,443 INFO L226 Difference]: Without dead ends: 250 [2019-02-15 10:49:09,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:49:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-15 10:49:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-15 10:49:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-15 10:49:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-15 10:49:09,450 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-15 10:49:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:09,451 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-15 10:49:09,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-15 10:49:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-15 10:49:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-15 10:49:09,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:09,452 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-15 10:49:09,452 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-15 10:49:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:09,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:09,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:09,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:11,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:11,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:11,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:11,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:11,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:11,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:11,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:11,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:11,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:11,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:11,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:11,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:14,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:18,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:18,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-15 10:49:18,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:18,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-15 10:49:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-15 10:49:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:49:18,248 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-15 10:49:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:18,720 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-15 10:49:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 10:49:18,721 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-15 10:49:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:18,722 INFO L225 Difference]: With dead ends: 255 [2019-02-15 10:49:18,722 INFO L226 Difference]: Without dead ends: 254 [2019-02-15 10:49:18,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:49:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-15 10:49:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-15 10:49:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-15 10:49:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-15 10:49:18,727 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-15 10:49:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:18,727 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-15 10:49:18,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-15 10:49:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-15 10:49:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-15 10:49:18,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:18,729 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-15 10:49:18,729 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-15 10:49:18,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:18,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:18,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:20,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:20,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:20,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:20,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:20,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:20,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:20,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:21,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-15 10:49:21,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:21,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:21,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:21,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:27,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-15 10:49:27,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:27,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-15 10:49:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-15 10:49:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 10:49:27,201 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-15 10:49:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:27,672 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-15 10:49:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 10:49:27,672 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-15 10:49:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:27,673 INFO L225 Difference]: With dead ends: 259 [2019-02-15 10:49:27,673 INFO L226 Difference]: Without dead ends: 258 [2019-02-15 10:49:27,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 10:49:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-15 10:49:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-15 10:49:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-15 10:49:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-15 10:49:27,678 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-15 10:49:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:27,678 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-15 10:49:27,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-15 10:49:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-15 10:49:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-15 10:49:27,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:27,679 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-15 10:49:27,680 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-15 10:49:27,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:27,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:27,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:29,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:29,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:29,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:29,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:29,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:29,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:30,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:30,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:30,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:30,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:30,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:30,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:30,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:30,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:30,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:32,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:36,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:36,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-15 10:49:36,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:36,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-15 10:49:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-15 10:49:36,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:49:36,631 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-15 10:49:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:37,105 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-15 10:49:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 10:49:37,106 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-15 10:49:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:37,107 INFO L225 Difference]: With dead ends: 263 [2019-02-15 10:49:37,107 INFO L226 Difference]: Without dead ends: 262 [2019-02-15 10:49:37,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:49:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-15 10:49:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-15 10:49:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-15 10:49:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-15 10:49:37,112 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-15 10:49:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:37,113 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-15 10:49:37,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-15 10:49:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-15 10:49:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-15 10:49:37,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:37,114 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-15 10:49:37,115 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-15 10:49:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:37,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:37,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:39,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:39,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:39,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:39,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:39,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:39,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:39,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:39,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:39,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:39,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:39,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:42,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:46,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:46,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-15 10:49:46,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:46,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-15 10:49:46,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-15 10:49:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-15 10:49:46,041 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-15 10:49:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:46,522 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-15 10:49:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 10:49:46,522 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-15 10:49:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:46,523 INFO L225 Difference]: With dead ends: 267 [2019-02-15 10:49:46,523 INFO L226 Difference]: Without dead ends: 266 [2019-02-15 10:49:46,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-15 10:49:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-15 10:49:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-15 10:49:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-15 10:49:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-15 10:49:46,530 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-15 10:49:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:46,531 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-15 10:49:46,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-15 10:49:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-15 10:49:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-15 10:49:46,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:46,532 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-15 10:49:46,533 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-15 10:49:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:46,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:48,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:48,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:48,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:48,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:48,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:48,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:48,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:49,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-15 10:49:49,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:49,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:49,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:49,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:49,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:51,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:55,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:55,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-15 10:49:55,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:55,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-15 10:49:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-15 10:49:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:49:55,950 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-15 10:49:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:56,508 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-15 10:49:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 10:49:56,509 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-15 10:49:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:56,510 INFO L225 Difference]: With dead ends: 271 [2019-02-15 10:49:56,511 INFO L226 Difference]: Without dead ends: 270 [2019-02-15 10:49:56,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:49:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-15 10:49:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-15 10:49:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-15 10:49:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-15 10:49:56,516 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-15 10:49:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:56,516 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-15 10:49:56,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-15 10:49:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-15 10:49:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-15 10:49:56,518 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:56,518 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-15 10:49:56,518 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-15 10:49:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:56,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:56,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:58,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:58,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:58,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:58,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:58,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:58,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:58,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:58,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:58,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:58,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:58,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:58,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:58,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:01,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:05,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:05,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-15 10:50:05,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:05,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-15 10:50:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-15 10:50:05,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:50:05,857 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-15 10:50:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:06,364 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-15 10:50:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 10:50:06,364 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-15 10:50:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:06,365 INFO L225 Difference]: With dead ends: 275 [2019-02-15 10:50:06,366 INFO L226 Difference]: Without dead ends: 274 [2019-02-15 10:50:06,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:50:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-15 10:50:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-15 10:50:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-15 10:50:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-15 10:50:06,370 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-15 10:50:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:06,371 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-15 10:50:06,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-15 10:50:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-15 10:50:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-15 10:50:06,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:06,372 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-15 10:50:06,372 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-15 10:50:06,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:06,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:06,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:08,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:08,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:08,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:08,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:08,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:08,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:08,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:08,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:08,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:08,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:08,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:11,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:15,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:15,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-15 10:50:15,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:15,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-15 10:50:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-15 10:50:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:50:15,741 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-15 10:50:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:16,344 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-15 10:50:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 10:50:16,344 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-15 10:50:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:16,345 INFO L225 Difference]: With dead ends: 279 [2019-02-15 10:50:16,345 INFO L226 Difference]: Without dead ends: 278 [2019-02-15 10:50:16,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:50:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-15 10:50:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-15 10:50:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-15 10:50:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-15 10:50:16,352 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-15 10:50:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:16,353 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-15 10:50:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-15 10:50:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-15 10:50:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-15 10:50:16,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:16,354 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-15 10:50:16,355 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-15 10:50:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:18,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:18,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:18,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:18,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:18,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:18,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:18,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:18,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:19,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-15 10:50:19,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:19,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:19,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:19,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:21,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:25,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-15 10:50:25,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:25,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-15 10:50:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-15 10:50:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-15 10:50:25,996 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-15 10:50:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:26,494 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-15 10:50:26,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 10:50:26,495 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-15 10:50:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:26,497 INFO L225 Difference]: With dead ends: 283 [2019-02-15 10:50:26,497 INFO L226 Difference]: Without dead ends: 282 [2019-02-15 10:50:26,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-15 10:50:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-15 10:50:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-15 10:50:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-15 10:50:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-15 10:50:26,504 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-15 10:50:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:26,505 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-15 10:50:26,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-15 10:50:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-15 10:50:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-15 10:50:26,506 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:26,506 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-15 10:50:26,507 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-15 10:50:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:28,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:28,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:28,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:28,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:28,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:28,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:28,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:28,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:29,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:29,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:29,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:29,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:29,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:32,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:36,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:36,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-15 10:50:36,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:36,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-15 10:50:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-15 10:50:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:50:36,353 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-15 10:50:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:36,940 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-15 10:50:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 10:50:36,940 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-15 10:50:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:36,942 INFO L225 Difference]: With dead ends: 287 [2019-02-15 10:50:36,942 INFO L226 Difference]: Without dead ends: 286 [2019-02-15 10:50:36,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:50:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-15 10:50:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-15 10:50:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-15 10:50:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-15 10:50:36,948 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-15 10:50:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:36,948 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-15 10:50:36,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-15 10:50:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-15 10:50:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-15 10:50:36,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:36,950 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-15 10:50:36,950 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-15 10:50:36,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:36,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:36,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:39,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:39,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:39,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:39,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:39,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:39,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:39,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:39,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:39,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:39,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:39,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:39,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:39,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:42,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:46,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-15 10:50:46,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:46,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-15 10:50:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-15 10:50:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-15 10:50:46,915 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-15 10:50:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:47,473 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-15 10:50:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 10:50:47,473 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-15 10:50:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:47,475 INFO L225 Difference]: With dead ends: 291 [2019-02-15 10:50:47,475 INFO L226 Difference]: Without dead ends: 290 [2019-02-15 10:50:47,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-15 10:50:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-15 10:50:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-15 10:50:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-15 10:50:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-15 10:50:47,482 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-15 10:50:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:47,482 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-15 10:50:47,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-15 10:50:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-15 10:50:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-15 10:50:47,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:47,483 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-15 10:50:47,483 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-15 10:50:47,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:47,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:47,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:50,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:50,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:50,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:50,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:50,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:50,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:50,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-15 10:50:50,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:50,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:50,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:50,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:50,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:50,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:53,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:58,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-15 10:50:58,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:58,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-15 10:50:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-15 10:50:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:50:58,072 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-15 10:50:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:58,669 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-15 10:50:58,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 10:50:58,670 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-15 10:50:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:58,671 INFO L225 Difference]: With dead ends: 295 [2019-02-15 10:50:58,671 INFO L226 Difference]: Without dead ends: 294 [2019-02-15 10:50:58,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:50:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-15 10:50:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-15 10:50:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-15 10:50:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-15 10:50:58,677 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-15 10:50:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-15 10:50:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-15 10:50:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-15 10:50:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-15 10:50:58,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:58,679 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-15 10:50:58,679 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-15 10:50:58,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:58,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:58,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:01,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:01,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:01,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:01,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:01,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:01,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:01,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:01,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:01,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:01,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:01,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:01,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:01,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:01,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:04,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-15 10:51:09,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:09,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-15 10:51:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-15 10:51:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:51:09,344 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-15 10:51:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:10,005 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-15 10:51:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 10:51:10,006 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-15 10:51:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:10,008 INFO L225 Difference]: With dead ends: 299 [2019-02-15 10:51:10,008 INFO L226 Difference]: Without dead ends: 298 [2019-02-15 10:51:10,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:51:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-15 10:51:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-15 10:51:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-15 10:51:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-15 10:51:10,013 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-15 10:51:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:10,014 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-15 10:51:10,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-15 10:51:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-15 10:51:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-15 10:51:10,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:10,015 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-15 10:51:10,015 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-15 10:51:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:10,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:10,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:12,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:12,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:12,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:12,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:12,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:12,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:12,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:12,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:12,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:12,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:16,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:20,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:20,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-15 10:51:20,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:20,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-15 10:51:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-15 10:51:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:51:20,335 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-15 10:51:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:20,961 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-15 10:51:20,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 10:51:20,962 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-15 10:51:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:20,964 INFO L225 Difference]: With dead ends: 303 [2019-02-15 10:51:20,964 INFO L226 Difference]: Without dead ends: 302 [2019-02-15 10:51:20,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:51:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-15 10:51:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-15 10:51:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-15 10:51:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-15 10:51:20,970 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-15 10:51:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:20,970 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-15 10:51:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-15 10:51:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-15 10:51:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-15 10:51:20,972 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:20,972 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-15 10:51:20,972 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-15 10:51:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:20,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:20,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:23,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:23,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:23,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:23,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:23,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:23,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:23,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:23,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:24,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-15 10:51:24,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:24,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:24,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:24,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:24,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:24,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:27,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:32,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:32,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-15 10:51:32,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:32,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-15 10:51:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-15 10:51:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-15 10:51:32,024 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-15 10:51:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:32,663 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-15 10:51:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 10:51:32,664 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-15 10:51:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:32,665 INFO L225 Difference]: With dead ends: 307 [2019-02-15 10:51:32,666 INFO L226 Difference]: Without dead ends: 306 [2019-02-15 10:51:32,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-15 10:51:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-15 10:51:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-15 10:51:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-15 10:51:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-15 10:51:32,671 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-15 10:51:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:32,671 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-15 10:51:32,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-15 10:51:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-15 10:51:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-15 10:51:32,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:32,672 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-15 10:51:32,673 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:32,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-15 10:51:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:32,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:32,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:35,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:35,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:35,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:35,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:35,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:35,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:35,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:35,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:35,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:35,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:35,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:35,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:35,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:39,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:43,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:43,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-15 10:51:43,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:43,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-15 10:51:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-15 10:51:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:51:43,600 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-15 10:51:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:44,226 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-15 10:51:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-15 10:51:44,227 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-15 10:51:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:44,229 INFO L225 Difference]: With dead ends: 311 [2019-02-15 10:51:44,229 INFO L226 Difference]: Without dead ends: 310 [2019-02-15 10:51:44,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:51:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-15 10:51:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-15 10:51:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-15 10:51:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-15 10:51:44,235 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-15 10:51:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:44,236 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-15 10:51:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-15 10:51:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-15 10:51:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-15 10:51:44,237 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:44,237 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-15 10:51:44,238 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-15 10:51:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:44,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:44,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:47,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:47,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:47,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:47,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:47,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:47,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:47,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:47,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:47,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:47,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:50,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-15 10:51:54,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:54,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-15 10:51:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-15 10:51:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-15 10:51:54,875 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-15 10:51:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:55,511 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-15 10:51:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 10:51:55,512 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-15 10:51:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:55,513 INFO L225 Difference]: With dead ends: 315 [2019-02-15 10:51:55,513 INFO L226 Difference]: Without dead ends: 314 [2019-02-15 10:51:55,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-15 10:51:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-15 10:51:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-15 10:51:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-15 10:51:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-15 10:51:55,520 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-15 10:51:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:55,520 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-15 10:51:55,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-15 10:51:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-15 10:51:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-15 10:51:55,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:55,522 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-15 10:51:55,522 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-15 10:51:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:55,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:55,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:58,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:58,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:58,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:58,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:58,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:58,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:58,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:58,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:59,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-15 10:51:59,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:59,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:59,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:59,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:59,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:59,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:02,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-15 10:52:07,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:07,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-15 10:52:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-15 10:52:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:52:07,201 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-15 10:52:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:07,826 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-15 10:52:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 10:52:07,827 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-15 10:52:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:07,828 INFO L225 Difference]: With dead ends: 319 [2019-02-15 10:52:07,828 INFO L226 Difference]: Without dead ends: 318 [2019-02-15 10:52:07,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:52:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-15 10:52:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-15 10:52:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-15 10:52:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-15 10:52:07,834 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-15 10:52:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:07,835 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-15 10:52:07,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-15 10:52:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-15 10:52:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-15 10:52:07,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:07,836 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-15 10:52:07,836 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-15 10:52:07,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:07,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:07,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:10,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:10,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:10,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:10,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:10,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:10,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:10,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:10,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:10,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:10,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:10,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:10,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:10,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:10,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:10,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:14,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:19,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-15 10:52:19,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-15 10:52:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-15 10:52:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:52:19,367 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-15 10:52:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:20,065 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-15 10:52:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 10:52:20,065 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-15 10:52:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:20,067 INFO L225 Difference]: With dead ends: 323 [2019-02-15 10:52:20,067 INFO L226 Difference]: Without dead ends: 322 [2019-02-15 10:52:20,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:52:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-15 10:52:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-15 10:52:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-15 10:52:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-15 10:52:20,072 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-15 10:52:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:20,072 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-15 10:52:20,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-15 10:52:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-15 10:52:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-15 10:52:20,073 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:20,074 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-15 10:52:20,074 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:20,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-15 10:52:20,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:20,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:20,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:20,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:20,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:23,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:23,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:23,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:23,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:23,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:23,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:23,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:23,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:23,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:23,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:23,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:23,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:23,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:27,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-15 10:52:31,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:31,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-15 10:52:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-15 10:52:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:31,396 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-15 10:52:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:32,099 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-15 10:52:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-15 10:52:32,100 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-15 10:52:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:32,102 INFO L225 Difference]: With dead ends: 327 [2019-02-15 10:52:32,102 INFO L226 Difference]: Without dead ends: 326 [2019-02-15 10:52:32,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-15 10:52:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-15 10:52:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-15 10:52:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-15 10:52:32,108 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-15 10:52:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:32,108 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-15 10:52:32,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-15 10:52:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-15 10:52:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-15 10:52:32,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:32,110 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-15 10:52:32,110 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-15 10:52:32,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:32,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:32,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:32,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:32,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:35,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:35,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:35,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:35,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:35,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:35,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:35,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:35,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:35,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-15 10:52:35,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:35,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:35,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:35,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:35,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:35,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:39,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-15 10:52:44,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:44,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-15 10:52:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-15 10:52:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-15 10:52:44,293 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-15 10:52:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:45,003 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-15 10:52:45,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 10:52:45,004 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-15 10:52:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:45,005 INFO L225 Difference]: With dead ends: 331 [2019-02-15 10:52:45,005 INFO L226 Difference]: Without dead ends: 330 [2019-02-15 10:52:45,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-15 10:52:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-15 10:52:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-15 10:52:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-15 10:52:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-15 10:52:45,011 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-15 10:52:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:45,011 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-15 10:52:45,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-15 10:52:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-15 10:52:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-15 10:52:45,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:45,012 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-15 10:52:45,012 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-15 10:52:45,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:48,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:48,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:48,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:48,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:48,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:48,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:48,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:48,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:48,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:48,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:48,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:52,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:56,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:56,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-15 10:52:56,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:56,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-15 10:52:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-15 10:52:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:56,897 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-15 10:52:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:57,601 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-15 10:52:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-15 10:52:57,602 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-15 10:52:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:57,603 INFO L225 Difference]: With dead ends: 335 [2019-02-15 10:52:57,604 INFO L226 Difference]: Without dead ends: 334 [2019-02-15 10:52:57,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-15 10:52:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-15 10:52:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-15 10:52:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-15 10:52:57,610 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-15 10:52:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:57,610 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-15 10:52:57,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-15 10:52:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-15 10:52:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-15 10:52:57,611 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:57,612 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-15 10:52:57,612 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-15 10:52:57,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:57,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:57,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:57,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:57,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:00,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:00,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:00,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:00,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:00,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:00,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:01,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:01,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:01,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:01,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:05,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:09,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-15 10:53:09,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:09,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-15 10:53:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-15 10:53:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 10:53:09,667 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-15 10:53:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:10,334 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-15 10:53:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 10:53:10,334 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-15 10:53:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:10,335 INFO L225 Difference]: With dead ends: 339 [2019-02-15 10:53:10,335 INFO L226 Difference]: Without dead ends: 338 [2019-02-15 10:53:10,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 10:53:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-15 10:53:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-15 10:53:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-15 10:53:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-15 10:53:10,342 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-15 10:53:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:10,342 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-15 10:53:10,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-15 10:53:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-15 10:53:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-15 10:53:10,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:10,344 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-15 10:53:10,344 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-15 10:53:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:10,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:10,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:13,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:13,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:13,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:13,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:13,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:13,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:13,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:13,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:14,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-15 10:53:14,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:14,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:14,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:14,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:14,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:18,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:22,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:22,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-15 10:53:22,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:22,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-15 10:53:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-15 10:53:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:53:22,867 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-15 10:53:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:23,696 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-15 10:53:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 10:53:23,696 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-15 10:53:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:23,698 INFO L225 Difference]: With dead ends: 343 [2019-02-15 10:53:23,698 INFO L226 Difference]: Without dead ends: 342 [2019-02-15 10:53:23,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:53:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-15 10:53:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-15 10:53:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-15 10:53:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-15 10:53:23,704 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-15 10:53:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:23,704 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-15 10:53:23,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-15 10:53:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-15 10:53:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-15 10:53:23,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:23,706 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-15 10:53:23,706 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-15 10:53:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:23,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:23,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:27,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:27,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:27,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:27,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:27,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:27,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:27,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:27,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:27,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:27,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:27,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:27,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:27,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:27,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:31,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:36,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:36,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-15 10:53:36,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:36,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-15 10:53:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-15 10:53:36,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:53:36,069 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-15 10:53:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:36,852 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-15 10:53:36,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 10:53:36,852 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-15 10:53:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:36,854 INFO L225 Difference]: With dead ends: 347 [2019-02-15 10:53:36,854 INFO L226 Difference]: Without dead ends: 346 [2019-02-15 10:53:36,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:53:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-15 10:53:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-15 10:53:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-15 10:53:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-15 10:53:36,861 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-15 10:53:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:36,861 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-15 10:53:36,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-15 10:53:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-15 10:53:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-15 10:53:36,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:36,863 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-15 10:53:36,863 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-15 10:53:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:36,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:36,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:40,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:40,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:40,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:40,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:40,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:40,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:40,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:40,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:40,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:40,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:40,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:40,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:40,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:45,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:49,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:49,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-15 10:53:49,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:49,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-15 10:53:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-15 10:53:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:49,509 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-15 10:53:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:50,296 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-15 10:53:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-15 10:53:50,296 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-15 10:53:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:50,299 INFO L225 Difference]: With dead ends: 351 [2019-02-15 10:53:50,299 INFO L226 Difference]: Without dead ends: 350 [2019-02-15 10:53:50,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-15 10:53:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-15 10:53:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-15 10:53:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-15 10:53:50,306 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-15 10:53:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:50,307 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-15 10:53:50,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-15 10:53:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-15 10:53:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-15 10:53:50,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:50,309 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-15 10:53:50,309 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-15 10:53:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:53,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:53,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:53,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:53,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:53,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:53,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:53,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:54,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-15 10:53:54,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:54,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:54,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:54,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:54,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:58,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:03,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:03,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-15 10:54:03,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:03,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-15 10:54:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-15 10:54:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-15 10:54:03,164 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-15 10:54:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:03,905 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-15 10:54:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 10:54:03,906 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-15 10:54:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:03,908 INFO L225 Difference]: With dead ends: 355 [2019-02-15 10:54:03,908 INFO L226 Difference]: Without dead ends: 354 [2019-02-15 10:54:03,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-15 10:54:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-15 10:54:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-15 10:54:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-15 10:54:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-15 10:54:03,914 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-15 10:54:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:03,915 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-15 10:54:03,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-15 10:54:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-15 10:54:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-15 10:54:03,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:03,916 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-15 10:54:03,916 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-15 10:54:03,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:03,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:03,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:07,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:07,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:07,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:07,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:07,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:07,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:07,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:07,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:07,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:07,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:07,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:07,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:07,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:07,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:07,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:12,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:17,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:17,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-15 10:54:17,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:17,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-15 10:54:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-15 10:54:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:54:17,146 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-15 10:54:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:17,843 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-15 10:54:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-15 10:54:17,844 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-15 10:54:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:17,846 INFO L225 Difference]: With dead ends: 359 [2019-02-15 10:54:17,846 INFO L226 Difference]: Without dead ends: 358 [2019-02-15 10:54:17,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:54:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-15 10:54:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-15 10:54:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-15 10:54:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-15 10:54:17,853 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-15 10:54:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:17,853 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-15 10:54:17,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-15 10:54:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-15 10:54:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-15 10:54:17,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:17,855 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-15 10:54:17,855 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-15 10:54:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:17,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:17,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:21,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:21,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:21,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:21,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:21,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:21,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:21,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:21,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:21,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:21,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:21,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:21,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:26,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:31,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:31,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-15 10:54:31,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:31,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-15 10:54:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-15 10:54:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-15 10:54:31,249 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-15 10:54:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:32,089 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-15 10:54:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 10:54:32,090 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-15 10:54:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:32,091 INFO L225 Difference]: With dead ends: 363 [2019-02-15 10:54:32,092 INFO L226 Difference]: Without dead ends: 362 [2019-02-15 10:54:32,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-15 10:54:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-15 10:54:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-15 10:54:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-15 10:54:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-15 10:54:32,098 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-15 10:54:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:32,099 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-15 10:54:32,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-15 10:54:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-15 10:54:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-15 10:54:32,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:32,100 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-15 10:54:32,100 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-15 10:54:32,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:32,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:32,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:32,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:32,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:36,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:36,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:36,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:36,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:36,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:36,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:36,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:36,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:36,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-15 10:54:36,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:36,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:36,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:36,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:36,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:36,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:41,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:46,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:46,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-15 10:54:46,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:46,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-15 10:54:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-15 10:54:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:54:46,026 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-15 10:54:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:46,789 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-15 10:54:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 10:54:46,789 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-15 10:54:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:46,791 INFO L225 Difference]: With dead ends: 367 [2019-02-15 10:54:46,792 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 10:54:46,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:54:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 10:54:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-15 10:54:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-15 10:54:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-15 10:54:46,798 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-15 10:54:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:46,799 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-15 10:54:46,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-15 10:54:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-15 10:54:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-15 10:54:46,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:46,800 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-15 10:54:46,800 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-15 10:54:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:46,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:46,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:50,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:50,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:50,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:50,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:50,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:50,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:50,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:50,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:51,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:51,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:51,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:51,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:51,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:51,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:51,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:55,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:00,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-15 10:55:00,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:00,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-15 10:55:00,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-15 10:55:00,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 10:55:00,300 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-15 10:55:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:01,086 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-15 10:55:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 10:55:01,086 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-15 10:55:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:01,087 INFO L225 Difference]: With dead ends: 371 [2019-02-15 10:55:01,087 INFO L226 Difference]: Without dead ends: 370 [2019-02-15 10:55:01,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 10:55:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-15 10:55:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-15 10:55:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-15 10:55:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-15 10:55:01,095 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-15 10:55:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:01,095 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-15 10:55:01,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-15 10:55:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-15 10:55:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-15 10:55:01,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:01,097 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-15 10:55:01,097 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-15 10:55:01,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:01,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:01,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:01,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:01,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:05,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:05,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:05,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:05,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:05,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:05,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:05,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:05,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:05,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:05,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:05,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:05,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:10,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:15,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:15,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-15 10:55:15,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:15,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-15 10:55:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-15 10:55:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:55:15,022 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-15 10:55:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:15,789 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-15 10:55:15,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-15 10:55:15,792 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-15 10:55:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:15,794 INFO L225 Difference]: With dead ends: 375 [2019-02-15 10:55:15,794 INFO L226 Difference]: Without dead ends: 374 [2019-02-15 10:55:15,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:55:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-15 10:55:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-15 10:55:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-15 10:55:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-15 10:55:15,801 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-15 10:55:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:15,801 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-15 10:55:15,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-15 10:55:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-15 10:55:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-15 10:55:15,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:15,803 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-15 10:55:15,803 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-15 10:55:15,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:15,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:15,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:15,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:15,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:20,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:20,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:20,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:20,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:20,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:20,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:20,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:20,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-15 10:55:20,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:20,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:20,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:20,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:20,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:20,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:25,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:30,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-15 10:55:30,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:30,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-15 10:55:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-15 10:55:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 10:55:30,394 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-15 10:55:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:31,125 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-15 10:55:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 10:55:31,125 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-15 10:55:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:31,127 INFO L225 Difference]: With dead ends: 379 [2019-02-15 10:55:31,127 INFO L226 Difference]: Without dead ends: 378 [2019-02-15 10:55:31,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 10:55:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-15 10:55:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-15 10:55:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-15 10:55:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-15 10:55:31,134 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-15 10:55:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:31,134 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-15 10:55:31,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-15 10:55:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-15 10:55:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-15 10:55:31,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:31,136 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-15 10:55:31,136 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-15 10:55:31,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:31,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:31,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:35,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:35,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:35,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:35,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:35,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:35,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:35,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:35,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:35,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:35,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:35,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:35,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:40,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:45,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:45,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-15 10:55:45,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:45,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-15 10:55:45,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-15 10:55:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:45,374 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-15 10:55:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:46,084 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-15 10:55:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-15 10:55:46,084 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-15 10:55:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:46,086 INFO L225 Difference]: With dead ends: 383 [2019-02-15 10:55:46,086 INFO L226 Difference]: Without dead ends: 382 [2019-02-15 10:55:46,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-15 10:55:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-15 10:55:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-15 10:55:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-15 10:55:46,093 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-15 10:55:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:46,094 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-15 10:55:46,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-15 10:55:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-15 10:55:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-15 10:55:46,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:46,095 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-15 10:55:46,095 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:46,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-15 10:55:46,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:46,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:46,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:46,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:50,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:50,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:50,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:50,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:50,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:50,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:50,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:50,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:50,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:50,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:50,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:50,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:50,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:55,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:00,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-15 10:56:00,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:00,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-15 10:56:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-15 10:56:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-15 10:56:00,475 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-02-15 10:56:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:01,299 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-02-15 10:56:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 10:56:01,299 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-02-15 10:56:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:01,301 INFO L225 Difference]: With dead ends: 387 [2019-02-15 10:56:01,301 INFO L226 Difference]: Without dead ends: 386 [2019-02-15 10:56:01,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-15 10:56:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-15 10:56:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-02-15 10:56:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-02-15 10:56:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-02-15 10:56:01,309 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-02-15 10:56:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:01,309 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-02-15 10:56:01,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-15 10:56:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-02-15 10:56:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-02-15 10:56:01,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:01,311 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-02-15 10:56:01,311 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-02-15 10:56:01,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:01,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:05,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:05,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:05,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:05,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:05,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:05,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:06,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-15 10:56:06,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:06,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:06,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:06,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:06,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:06,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:12,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:16,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:16,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-15 10:56:16,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:16,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-15 10:56:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-15 10:56:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:56:16,764 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-02-15 10:56:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:17,695 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-15 10:56:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 10:56:17,698 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-02-15 10:56:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:17,701 INFO L225 Difference]: With dead ends: 391 [2019-02-15 10:56:17,701 INFO L226 Difference]: Without dead ends: 390 [2019-02-15 10:56:17,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:56:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-15 10:56:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-02-15 10:56:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-02-15 10:56:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-02-15 10:56:17,708 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-02-15 10:56:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:17,709 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-02-15 10:56:17,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-15 10:56:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-02-15 10:56:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-02-15 10:56:17,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:17,711 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-02-15 10:56:17,711 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-02-15 10:56:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:17,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:17,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:22,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:22,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:22,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:22,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:22,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:22,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:56:22,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:56:22,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:56:22,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:22,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:22,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:22,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:22,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:28,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:32,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:32,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-15 10:56:32,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:32,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-15 10:56:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-15 10:56:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:56:32,577 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-02-15 10:56:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:33,497 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-15 10:56:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 10:56:33,498 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-02-15 10:56:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:33,499 INFO L225 Difference]: With dead ends: 395 [2019-02-15 10:56:33,499 INFO L226 Difference]: Without dead ends: 394 [2019-02-15 10:56:33,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:56:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-15 10:56:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-02-15 10:56:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-02-15 10:56:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-02-15 10:56:33,506 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-02-15 10:56:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:33,507 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-02-15 10:56:33,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-15 10:56:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-02-15 10:56:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-02-15 10:56:33,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:33,508 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-02-15 10:56:33,508 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-02-15 10:56:33,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:33,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:33,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:38,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:38,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:38,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:38,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:38,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:38,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:38,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:38,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:38,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:38,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:38,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:43,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:48,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-15 10:56:48,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:48,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-15 10:56:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-15 10:56:48,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:56:48,387 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-02-15 10:56:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:49,184 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-02-15 10:56:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-15 10:56:49,184 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-02-15 10:56:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:49,186 INFO L225 Difference]: With dead ends: 399 [2019-02-15 10:56:49,187 INFO L226 Difference]: Without dead ends: 398 [2019-02-15 10:56:49,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:56:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-02-15 10:56:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-02-15 10:56:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-15 10:56:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-15 10:56:49,194 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-02-15 10:56:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:49,194 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-15 10:56:49,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-15 10:56:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-15 10:56:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-15 10:56:49,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:49,195 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-02-15 10:56:49,196 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-02-15 10:56:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:49,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:49,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:54,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:54,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:54,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:54,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:54,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:54,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:54,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:54,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-15 10:56:54,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:54,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:54,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:54,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:54,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:54,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:57:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:00,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:05,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:05,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-15 10:57:05,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:05,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-15 10:57:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-15 10:57:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-15 10:57:05,222 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-02-15 10:57:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:06,049 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-02-15 10:57:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 10:57:06,056 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-02-15 10:57:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:06,058 INFO L225 Difference]: With dead ends: 403 [2019-02-15 10:57:06,058 INFO L226 Difference]: Without dead ends: 402 [2019-02-15 10:57:06,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-15 10:57:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-15 10:57:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-02-15 10:57:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-15 10:57:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-15 10:57:06,066 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-02-15 10:57:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-15 10:57:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-15 10:57:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-15 10:57:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-15 10:57:06,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:06,069 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-02-15 10:57:06,069 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-02-15 10:57:06,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:06,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:06,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:11,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:11,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:11,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:11,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:11,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:11,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:11,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:11,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:11,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:11,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:11,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:11,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:57:11,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:11,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:57:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:17,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:21,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:21,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-15 10:57:21,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:21,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-15 10:57:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-15 10:57:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:57:21,678 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-02-15 10:57:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:22,576 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-02-15 10:57:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 10:57:22,577 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-02-15 10:57:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:22,578 INFO L225 Difference]: With dead ends: 407 [2019-02-15 10:57:22,578 INFO L226 Difference]: Without dead ends: 406 [2019-02-15 10:57:22,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:57:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-02-15 10:57:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-02-15 10:57:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-02-15 10:57:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-02-15 10:57:22,585 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-02-15 10:57:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:22,585 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-02-15 10:57:22,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-15 10:57:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-02-15 10:57:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-02-15 10:57:22,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:22,587 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-02-15 10:57:22,588 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-02-15 10:57:22,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:22,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:22,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:22,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:22,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:27,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:27,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:27,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:27,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:27,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:27,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:27,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:27,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:27,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:27,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:32,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:32,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-02-15 10:57:32,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 10:57:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 10:57:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-02-15 10:57:32,708 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-02-15 10:57:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:34,161 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-02-15 10:57:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-15 10:57:34,161 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-02-15 10:57:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:34,162 INFO L225 Difference]: With dead ends: 408 [2019-02-15 10:57:34,162 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:57:34,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:57:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:57:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:57:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:57:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:57:34,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-02-15 10:57:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:34,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:57:34,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 10:57:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:57:34,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:57:34,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:57:37,088 WARN L181 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-15 10:57:37,093 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-02-15 10:57:37,094 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-02-15 10:57:37,094 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-02-15 10:57:37,094 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-02-15 10:57:37,094 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-02-15 10:57:37,094 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-02-15 10:57:37,096 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-15 10:57:37,096 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-02-15 10:57:37,148 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:57:37 BoogieIcfgContainer [2019-02-15 10:57:37,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:57:37,149 INFO L168 Benchmark]: Toolchain (without parser) took 753157.72 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.2 MB in the beginning and 942.1 MB in the end (delta: -835.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-02-15 10:57:37,150 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:57:37,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 138.9 MB. Free memory was 106.2 MB in the beginning and 104.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-15 10:57:37,151 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 10:57:37,151 INFO L168 Benchmark]: RCFGBuilder took 343.54 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 92.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-15 10:57:37,151 INFO L168 Benchmark]: TraceAbstraction took 752733.75 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 92.4 MB in the beginning and 942.1 MB in the end (delta: -849.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-02-15 10:57:37,154 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.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 138.9 MB. Free memory was 106.2 MB in the beginning and 104.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 343.54 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 92.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 752733.75 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 92.4 MB in the beginning and 942.1 MB in the end (delta: -849.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: 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: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 752.5s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 45.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 640.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 14.2s SatisfiabilityAnalysisTime, 676.0s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...