java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:02,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:02,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:02,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:02,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:02,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:02,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:02,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:02,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:02,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:02,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:02,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:02,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:02,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:02,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:02,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:02,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:02,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:02,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:02,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:02,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:02,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:02,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:02,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:02,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:02,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:02,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:02,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:02,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:02,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:02,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:02,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:02,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:02,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:02,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:02,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:02,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-03-04 16:53:02,854 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:02,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:02,855 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:02,855 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:02,856 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:02,856 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:02,856 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:02,856 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:02,856 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:02,857 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:02,857 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:02,857 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:02,857 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:02,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:02,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:02,863 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:02,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:02,863 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:02,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:02,865 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:02,867 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:02,867 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:02,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:02,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:02,869 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:02,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:02,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:02,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:02,870 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:02,870 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:02,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:02,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:02,871 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:02,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:02,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:02,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:02,930 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:02,931 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:02,932 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-03-04 16:53:02,932 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-03-04 16:53:02,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:02,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:02,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:02,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:03,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,038 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:53:03,038 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:53:03,038 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:53:03,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:03,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:03,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:03,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:03,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:03,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:03,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:03,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:03,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:03,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (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-03-04 16:53:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:53:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:53:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:53:03,447 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:53:03,447 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-03-04 16:53:03,448 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03 BoogieIcfgContainer [2019-03-04 16:53:03,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:03,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:03,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:03,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:03,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/2) ... [2019-03-04 16:53:03,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55ea3c and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:03, skipping insertion in model container [2019-03-04 16:53:03,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03" (2/2) ... [2019-03-04 16:53:03,457 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-03-04 16:53:03,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:03,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:53:03,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:53:03,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:03,560 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:03,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:03,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:03,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:03,561 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:03,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:03,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-03-04 16:53:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:03,584 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:03,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-03-04 16:53:03,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:03,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:03,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:03,829 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-03-04 16:53:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:03,913 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-03-04 16:53:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:03,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:53:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:03,927 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:53:03,927 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:53:03,931 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-03-04 16:53:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:53:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:53:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:53:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:53:03,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-03-04 16:53:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:03,965 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:53:03,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:53:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:53:03,966 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-03-04 16:53:03,966 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-03-04 16:53:03,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:04,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:53:04,059 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-03-04 16:53:04,120 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:04,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:14,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:14,498 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:14,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:14,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,506 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-03-04 16:53:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:14,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:14,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:14,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:14,640 INFO L453 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-03-04 16:53:14,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:14,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:14,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:14,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:14,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:14,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:14,948 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-03-04 16:53:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:15,063 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-03-04 16:53:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:15,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-03-04 16:53:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:15,065 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:53:15,066 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:53:15,067 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-03-04 16:53:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:53:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:53:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:53:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-03-04 16:53:15,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-03-04 16:53:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:15,071 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-03-04 16:53:15,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-03-04 16:53:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:53:15,072 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:15,072 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-03-04 16:53:15,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-03-04 16:53:15,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:15,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:15,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:15,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,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 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-03-04 16:53:15,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:15,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:15,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:15,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:15,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:53:15,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:15,432 INFO L453 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-03-04 16:53:15,433 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:15,523 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:15,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:15,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:15,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:15,760 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-03-04 16:53:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:15,910 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-03-04 16:53:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:15,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-03-04 16:53:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:15,911 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:53:15,911 INFO L226 Difference]: Without dead ends: 18 [2019-03-04 16:53:15,912 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-03-04 16:53:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-03-04 16:53:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-03-04 16:53:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:53:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-03-04 16:53:15,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-03-04 16:53:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:15,916 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-03-04 16:53:15,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-03-04 16:53:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-03-04 16:53:15,917 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:15,917 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-03-04 16:53:15,917 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-03-04 16:53:15,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:16,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:16,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:16,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,049 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-03-04 16:53:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:16,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:16,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:16,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:16,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:53:16,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:16,101 INFO L453 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-03-04 16:53:16,101 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,135 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:53:16,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:16,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:16,328 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-03-04 16:53:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:16,675 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-03-04 16:53:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:16,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-03-04 16:53:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:16,677 INFO L225 Difference]: With dead ends: 23 [2019-03-04 16:53:16,677 INFO L226 Difference]: Without dead ends: 22 [2019-03-04 16:53:16,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-03-04 16:53:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-03-04 16:53:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:53:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-03-04 16:53:16,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-03-04 16:53:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:16,685 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-03-04 16:53:16,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-03-04 16:53:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:53:16,686 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:16,686 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-03-04 16:53:16,686 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-03-04 16:53:16,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:16,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:16,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:16,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:16,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:16,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,792 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-03-04 16:53:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:16,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:16,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:53:16,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:16,849 INFO L453 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-03-04 16:53:16,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,874 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,874 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:17,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:53:17,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:17,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:53:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:53:17,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:17,077 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-03-04 16:53:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:17,130 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-03-04 16:53:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:17,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-03-04 16:53:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:17,137 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:53:17,137 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:53:17,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:53:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-03-04 16:53:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:53:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-03-04 16:53:17,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-03-04 16:53:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:17,142 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-03-04 16:53:17,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:53:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-03-04 16:53:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-03-04 16:53:17,143 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:17,143 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-03-04 16:53:17,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-03-04 16:53:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:17,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:17,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:17,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,266 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-03-04 16:53:17,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:17,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:17,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:53:17,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:17,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:53:17,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:17,302 INFO L453 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-03-04 16:53:17,303 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:17,321 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:17,321 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:17,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:53:17,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:17,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:53:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:53:17,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:53:17,782 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-03-04 16:53:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:17,850 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-03-04 16:53:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:17,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-03-04 16:53:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:17,852 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:53:17,852 INFO L226 Difference]: Without dead ends: 30 [2019-03-04 16:53:17,853 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-03-04 16:53:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-03-04 16:53:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-03-04 16:53:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:53:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-03-04 16:53:17,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-03-04 16:53:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:17,858 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-03-04 16:53:17,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:53:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-03-04 16:53:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-03-04 16:53:17,859 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:17,860 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-03-04 16:53:17,860 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-03-04 16:53:17,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:17,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:17,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:17,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,999 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-03-04 16:53:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:18,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:18,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:18,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:53:18,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:18,034 INFO L453 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-03-04 16:53:18,035 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,043 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,043 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:18,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-03-04 16:53:18,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:18,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:53:18,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:53:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:18,288 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-03-04 16:53:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:18,429 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-03-04 16:53:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:53:18,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-03-04 16:53:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:18,430 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:53:18,431 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:53:18,431 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-03-04 16:53:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:53:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-03-04 16:53:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:53:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-03-04 16:53:18,436 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-03-04 16:53:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:18,437 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-03-04 16:53:18,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:53:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-03-04 16:53:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-03-04 16:53:18,438 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:18,438 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-03-04 16:53:18,438 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-03-04 16:53:18,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:18,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:18,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:18,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:18,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:18,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:18,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:18,617 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-03-04 16:53:18,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:18,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:53:18,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:18,661 INFO L453 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-03-04 16:53:18,661 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,669 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,669 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:19,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-03-04 16:53:19,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:53:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:53:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:19,042 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-03-04 16:53:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:19,233 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-03-04 16:53:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:53:19,234 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-03-04 16:53:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:19,235 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:53:19,235 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:53:19,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:53:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-03-04 16:53:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:53:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-03-04 16:53:19,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-03-04 16:53:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:19,242 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-03-04 16:53:19,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:53:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-03-04 16:53:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-03-04 16:53:19,243 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:19,244 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-03-04 16:53:19,244 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-03-04 16:53:19,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:19,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:19,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:19,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:19,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:19,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:19,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,449 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-03-04 16:53:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:19,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:19,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:53:19,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:19,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:53:19,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:19,496 INFO L453 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-03-04 16:53:19,496 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:19,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:19,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:19,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-03-04 16:53:19,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:19,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:53:19,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:53:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:19,979 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-03-04 16:53:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:20,110 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-03-04 16:53:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:53:20,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-03-04 16:53:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:20,111 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:53:20,111 INFO L226 Difference]: Without dead ends: 42 [2019-03-04 16:53:20,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-03-04 16:53:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-03-04 16:53:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:53:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-03-04 16:53:20,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-03-04 16:53:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:20,118 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-03-04 16:53:20,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:53:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-03-04 16:53:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-03-04 16:53:20,119 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:20,120 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-03-04 16:53:20,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-03-04 16:53:20,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:20,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:20,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:20,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:20,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:20,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:20,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:20,381 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-03-04 16:53:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:20,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:20,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:20,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:20,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:53:20,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:20,439 INFO L453 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-03-04 16:53:20,440 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:20,449 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:20,450 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:20,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-03-04 16:53:20,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:20,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:53:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:53:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:20,859 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-03-04 16:53:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:20,942 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-03-04 16:53:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:53:20,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-03-04 16:53:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:20,944 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:53:20,944 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:53:20,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:53:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-03-04 16:53:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:53:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-03-04 16:53:20,951 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-03-04 16:53:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:20,951 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-03-04 16:53:20,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:53:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-03-04 16:53:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-03-04 16:53:20,953 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:20,953 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-03-04 16:53:20,953 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-03-04 16:53:20,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:21,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:21,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:21,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:21,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:21,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:21,140 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-03-04 16:53:21,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:21,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:21,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:53:21,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:21,182 INFO L453 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-03-04 16:53:21,183 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:21,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:21,194 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:21,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:21,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:21,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-03-04 16:53:21,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:21,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:53:21,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:53:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:21,646 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-03-04 16:53:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:21,762 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-03-04 16:53:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:53:21,762 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-03-04 16:53:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:21,763 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:53:21,763 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:53:21,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:53:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-03-04 16:53:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:53:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-03-04 16:53:21,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-03-04 16:53:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:21,770 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-03-04 16:53:21,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:53:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-03-04 16:53:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:53:21,771 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:21,771 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-03-04 16:53:21,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-03-04 16:53:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:21,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:22,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:22,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:22,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:22,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 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-03-04 16:53:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:22,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:22,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-03-04 16:53:22,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:22,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:53:22,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:22,119 INFO L453 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-03-04 16:53:22,120 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:22,131 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:22,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:22,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-03-04 16:53:22,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:22,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:53:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:53:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:22,601 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-03-04 16:53:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:22,690 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-03-04 16:53:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:53:22,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-03-04 16:53:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:22,692 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:53:22,692 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:53:22,693 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-03-04 16:53:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:53:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-03-04 16:53:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:53:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-03-04 16:53:22,699 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-03-04 16:53:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:22,699 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-03-04 16:53:22,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:53:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-03-04 16:53:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-03-04 16:53:22,700 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:22,700 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-03-04 16:53:22,700 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-03-04 16:53:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:22,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:22,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:23,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:23,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:23,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:23,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:23,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:23,228 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-03-04 16:53:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:23,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:23,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:23,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:23,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:53:23,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:23,265 INFO L453 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-03-04 16:53:23,265 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:23,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:23,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:23,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-03-04 16:53:24,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:24,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:53:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:53:24,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:53:24,098 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-03-04 16:53:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:24,202 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-03-04 16:53:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:53:24,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-03-04 16:53:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:24,204 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:53:24,204 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:53:24,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:53:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:53:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-03-04 16:53:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-03-04 16:53:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-03-04 16:53:24,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-03-04 16:53:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:24,212 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-03-04 16:53:24,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:53:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-03-04 16:53:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-03-04 16:53:24,213 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:24,214 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-03-04 16:53:24,214 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-03-04 16:53:24,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:24,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:24,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:24,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:24,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:24,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,939 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-03-04 16:53:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:24,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:24,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:53:24,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:25,007 INFO L453 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-03-04 16:53:25,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:25,012 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:25,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:25,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-03-04 16:53:26,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:26,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:53:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:53:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:26,150 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-03-04 16:53:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:26,303 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-03-04 16:53:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:53:26,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-03-04 16:53:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:26,305 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:53:26,305 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:53:26,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:53:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-03-04 16:53:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:53:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:53:26,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-03-04 16:53:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:26,313 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:53:26,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:53:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:53:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:53:26,314 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:26,314 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-03-04 16:53:26,314 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-03-04 16:53:26,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:26,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:26,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:26,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:26,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:26,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:26,725 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-03-04 16:53:26,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:26,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:26,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:53:26,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:53:26,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:26,777 INFO L453 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-03-04 16:53:26,778 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:26,786 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:26,786 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:27,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-03-04 16:53:28,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:28,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:53:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:53:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:28,135 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-03-04 16:53:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:28,350 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-03-04 16:53:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:53:28,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-03-04 16:53:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:28,351 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:53:28,352 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:53:28,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:53:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-03-04 16:53:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:53:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-03-04 16:53:28,359 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-03-04 16:53:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-03-04 16:53:28,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:53:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-03-04 16:53:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-03-04 16:53:28,361 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:28,365 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-03-04 16:53:28,365 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:28,365 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-03-04 16:53:28,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:28,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:28,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:29,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:29,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:29,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:29,135 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-03-04 16:53:29,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:29,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:29,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:29,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:29,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:53:29,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:29,187 INFO L453 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-03-04 16:53:29,188 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:29,196 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:29,197 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:29,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:29,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-03-04 16:53:29,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:29,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:53:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:53:29,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:29,819 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-03-04 16:53:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:29,948 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-03-04 16:53:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:53:29,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-03-04 16:53:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:29,949 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:53:29,950 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:53:29,951 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-03-04 16:53:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:53:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-03-04 16:53:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-03-04 16:53:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-03-04 16:53:29,958 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-03-04 16:53:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:29,958 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-03-04 16:53:29,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:53:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-03-04 16:53:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-03-04 16:53:29,959 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:29,959 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-03-04 16:53:29,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-03-04 16:53:29,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:29,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:29,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:30,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:30,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:30,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:30,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:30,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:30,305 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-03-04 16:53:30,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:30,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:30,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:53:30,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:30,363 INFO L453 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-03-04 16:53:30,364 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:30,371 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:30,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:31,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-03-04 16:53:31,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:31,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:53:31,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:53:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:53:31,828 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-03-04 16:53:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:31,950 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:53:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:53:31,952 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-03-04 16:53:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:31,954 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:53:31,954 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:53:31,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:53:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:53:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-03-04 16:53:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:53:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-03-04 16:53:31,961 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-03-04 16:53:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:31,961 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-03-04 16:53:31,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:53:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-03-04 16:53:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:53:31,962 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:31,963 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-03-04 16:53:31,963 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-03-04 16:53:31,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:31,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:32,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:32,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:32,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:32,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:32,355 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-03-04 16:53:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:32,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:32,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:53:32,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:32,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:53:32,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:32,415 INFO L453 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-03-04 16:53:32,416 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:32,426 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:32,427 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:33,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:33,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-03-04 16:53:33,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:53:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:53:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:53:33,181 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-03-04 16:53:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:33,292 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-03-04 16:53:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:53:33,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-03-04 16:53:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:33,294 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:53:33,294 INFO L226 Difference]: Without dead ends: 78 [2019-03-04 16:53:33,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:53:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-03-04 16:53:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-03-04 16:53:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:53:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-03-04 16:53:33,301 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-03-04 16:53:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:33,301 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-03-04 16:53:33,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:53:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-03-04 16:53:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-03-04 16:53:33,302 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:33,302 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-03-04 16:53:33,302 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:33,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-03-04 16:53:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:33,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:33,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:33,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:33,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:33,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:33,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:33,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:33,643 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-03-04 16:53:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:33,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:33,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:33,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:33,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:53:33,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:33,703 INFO L453 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-03-04 16:53:33,704 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:33,714 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:33,714 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:34,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:34,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:34,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-03-04 16:53:34,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:34,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:53:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:53:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:53:34,810 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-03-04 16:53:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:34,965 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-03-04 16:53:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:53:34,965 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-03-04 16:53:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:34,966 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:53:34,966 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:53:34,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:53:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:53:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-03-04 16:53:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:53:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-03-04 16:53:34,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-03-04 16:53:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:34,972 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-03-04 16:53:34,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:53:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-03-04 16:53:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-03-04 16:53:34,973 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:34,973 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-03-04 16:53:34,973 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-03-04 16:53:34,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:34,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:34,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:35,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:35,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:35,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,365 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-03-04 16:53:35,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:35,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:53:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:35,420 INFO L453 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-03-04 16:53:35,420 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,433 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-03-04 16:53:36,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:36,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:53:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:53:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:36,462 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-03-04 16:53:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:36,602 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-03-04 16:53:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:53:36,602 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-03-04 16:53:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:36,604 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:53:36,604 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:53:36,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:53:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-03-04 16:53:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:53:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-03-04 16:53:36,609 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-03-04 16:53:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:36,610 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-03-04 16:53:36,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:53:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-03-04 16:53:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-03-04 16:53:36,610 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:36,611 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-03-04 16:53:36,611 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-03-04 16:53:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:37,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:37,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:37,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,153 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-03-04 16:53:37,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:37,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:37,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-03-04 16:53:37,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:37,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:53:37,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:37,225 INFO L453 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-03-04 16:53:37,225 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,238 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:38,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-03-04 16:53:38,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:38,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:53:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:53:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:53:38,401 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-03-04 16:53:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:38,598 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-03-04 16:53:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:53:38,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-03-04 16:53:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:38,599 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:53:38,600 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:53:38,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:53:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:53:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-03-04 16:53:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-03-04 16:53:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-03-04 16:53:38,606 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-03-04 16:53:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:38,606 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-03-04 16:53:38,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:53:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-03-04 16:53:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-03-04 16:53:38,607 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:38,608 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-03-04 16:53:38,608 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-03-04 16:53:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:39,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:39,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:39,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,239 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-03-04 16:53:39,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:39,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:39,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:39,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:39,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:53:39,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:39,279 INFO L453 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-03-04 16:53:39,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,291 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,291 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:40,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-03-04 16:53:40,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:40,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:53:40,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:53:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:53:40,364 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-03-04 16:53:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:40,545 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-03-04 16:53:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:53:40,548 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-03-04 16:53:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:40,550 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:53:40,550 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:53:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:53:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:53:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-03-04 16:53:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:53:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-03-04 16:53:40,553 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-03-04 16:53:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:40,553 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-03-04 16:53:40,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:53:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-03-04 16:53:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-03-04 16:53:40,554 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:40,554 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-03-04 16:53:40,555 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-03-04 16:53:40,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:40,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:40,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:40,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:40,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:40,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 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-03-04 16:53:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:40,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:40,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:53:40,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:40,982 INFO L453 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-03-04 16:53:40,982 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-03-04 16:53:42,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:42,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:53:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:53:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:53:42,370 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-03-04 16:53:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:42,521 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-03-04 16:53:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:53:42,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-03-04 16:53:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:42,523 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:53:42,524 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:53:42,525 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-03-04 16:53:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:53:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-03-04 16:53:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:53:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-03-04 16:53:42,528 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-03-04 16:53:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:42,529 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-03-04 16:53:42,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:53:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-03-04 16:53:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-03-04 16:53:42,530 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:42,530 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-03-04 16:53:42,530 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-03-04 16:53:42,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:43,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:43,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:43,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,006 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-03-04 16:53:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:43,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:43,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:53:43,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:43,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:53:43,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:43,082 INFO L453 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-03-04 16:53:43,082 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,091 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-03-04 16:53:44,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:44,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:53:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:53:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:53:44,779 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-03-04 16:53:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:44,958 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-03-04 16:53:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:53:44,959 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-03-04 16:53:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:44,960 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:53:44,960 INFO L226 Difference]: Without dead ends: 102 [2019-03-04 16:53:44,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:53:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-03-04 16:53:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-03-04 16:53:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:53:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-03-04 16:53:44,966 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-03-04 16:53:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:44,966 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-03-04 16:53:44,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:53:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-03-04 16:53:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:53:44,967 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:44,967 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-03-04 16:53:44,967 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-03-04 16:53:44,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:44,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:44,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:44,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:45,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:45,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:45,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,392 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-03-04 16:53:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:45,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:45,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:45,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:53:45,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:45,464 INFO L453 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-03-04 16:53:45,464 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,473 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,474 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:46,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-03-04 16:53:46,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:53:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:53:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:53:46,891 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-03-04 16:53:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:47,112 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-03-04 16:53:47,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:53:47,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-03-04 16:53:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:47,113 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:53:47,113 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:53:47,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:53:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:53:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-03-04 16:53:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:53:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-03-04 16:53:47,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-03-04 16:53:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:47,119 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-03-04 16:53:47,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:53:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-03-04 16:53:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-03-04 16:53:47,120 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:47,120 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-03-04 16:53:47,121 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-03-04 16:53:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:47,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:47,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:47,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,609 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-03-04 16:53:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:47,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:53:47,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:47,660 INFO L453 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-03-04 16:53:47,660 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,669 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,669 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:49,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-03-04 16:53:49,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:49,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:53:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:53:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:53:49,064 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-03-04 16:53:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:49,263 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-03-04 16:53:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:53:49,263 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-03-04 16:53:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:49,265 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:53:49,265 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:53:49,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:53:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:53:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-03-04 16:53:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:53:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-03-04 16:53:49,271 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-03-04 16:53:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:49,271 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-03-04 16:53:49,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:53:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-03-04 16:53:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-03-04 16:53:49,272 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:49,272 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-03-04 16:53:49,272 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-03-04 16:53:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:49,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:49,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:49,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,924 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-03-04 16:53:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:49,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:50,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:53:50,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:50,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:53:50,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:50,019 INFO L453 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-03-04 16:53:50,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,028 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:51,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-03-04 16:53:51,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:51,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:53:51,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:53:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:53:51,616 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-03-04 16:53:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:51,818 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-03-04 16:53:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:53:51,819 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-03-04 16:53:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:51,820 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:53:51,820 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:53:51,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:53:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:53:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-03-04 16:53:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-03-04 16:53:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-03-04 16:53:51,825 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-03-04 16:53:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:51,826 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-03-04 16:53:51,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:53:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-03-04 16:53:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-03-04 16:53:51,826 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:51,827 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-03-04 16:53:51,827 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-03-04 16:53:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:53,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:53,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,286 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-03-04 16:53:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:53,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:53,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:53,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:53,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:53:53,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:53,376 INFO L453 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-03-04 16:53:53,377 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:55,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-03-04 16:53:55,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:55,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:53:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:53:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:53:55,449 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-03-04 16:53:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:55,655 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-03-04 16:53:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:53:55,656 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-03-04 16:53:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:55,657 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:53:55,657 INFO L226 Difference]: Without dead ends: 118 [2019-03-04 16:53:55,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:53:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-03-04 16:53:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-03-04 16:53:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:53:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-03-04 16:53:55,663 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-03-04 16:53:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:55,663 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-03-04 16:53:55,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:53:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-03-04 16:53:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-03-04 16:53:55,663 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:55,664 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-03-04 16:53:55,664 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-03-04 16:53:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:55,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:55,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:56,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:56,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:56,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:56,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 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-03-04 16:53:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:56,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:56,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2019-03-04 16:53:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:56,310 INFO L453 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-03-04 16:53:56,310 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:56,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:56,384 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:57,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:58,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-03-04 16:53:58,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:58,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:53:58,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:53:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:53:58,292 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-03-04 16:53:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:58,506 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-03-04 16:53:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:53:58,506 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-03-04 16:53:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:58,508 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:53:58,508 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:53:58,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:53:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:53:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-03-04 16:53:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:53:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:53:58,514 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-03-04 16:53:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:58,514 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:53:58,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:53:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:53:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:53:58,515 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:58,515 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-03-04 16:53:58,515 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-03-04 16:53:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:59,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:59,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:59,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,152 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-03-04 16:53:59,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:59,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:59,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:53:59,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:59,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:53:59,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:59,287 INFO L453 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-03-04 16:53:59,288 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,295 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,295 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:01,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-03-04 16:54:01,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:01,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:54:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:54:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:54:01,434 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-03-04 16:54:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:01,652 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-03-04 16:54:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:54:01,652 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-03-04 16:54:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:01,653 INFO L225 Difference]: With dead ends: 127 [2019-03-04 16:54:01,654 INFO L226 Difference]: Without dead ends: 126 [2019-03-04 16:54:01,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:54:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-03-04 16:54:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-03-04 16:54:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-03-04 16:54:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-03-04 16:54:01,659 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-03-04 16:54:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:01,659 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-03-04 16:54:01,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:54:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-03-04 16:54:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-03-04 16:54:01,660 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:01,660 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-03-04 16:54:01,660 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-03-04 16:54:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:01,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:01,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:01,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:02,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:02,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:02,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,313 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-03-04 16:54:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:02,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:02,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:02,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:54:02,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:02,371 INFO L453 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-03-04 16:54:02,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,381 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:04,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-03-04 16:54:04,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:04,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:54:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:54:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:54:04,325 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-03-04 16:54:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:04,616 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-03-04 16:54:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:54:04,616 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-03-04 16:54:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:04,617 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:54:04,617 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:54:04,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:54:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:54:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-03-04 16:54:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-03-04 16:54:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-03-04 16:54:04,622 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-03-04 16:54:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:04,623 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-03-04 16:54:04,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:54:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-03-04 16:54:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-03-04 16:54:04,624 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:04,624 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-03-04 16:54:04,624 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-03-04 16:54:04,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:05,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:05,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:05,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,263 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-03-04 16:54:05,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:05,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:54:05,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:05,321 INFO L453 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-03-04 16:54:05,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:07,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-03-04 16:54:07,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:07,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:54:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:54:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:07,380 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-03-04 16:54:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:07,598 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:54:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:54:07,598 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-03-04 16:54:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:07,600 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:54:07,600 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:54:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:54:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-03-04 16:54:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:54:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-03-04 16:54:07,606 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-03-04 16:54:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:07,606 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-03-04 16:54:07,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:54:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-03-04 16:54:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:54:07,607 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:07,607 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-03-04 16:54:07,607 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:07,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-03-04 16:54:07,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:07,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:07,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:07,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:07,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:08,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:08,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:08,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:08,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:08,309 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-03-04 16:54:08,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:08,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:08,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-03-04 16:54:08,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:08,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:54:08,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:08,487 INFO L453 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-03-04 16:54:08,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,497 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:08,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-03-04 16:54:10,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:10,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:54:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:54:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:54:10,858 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-03-04 16:54:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:11,090 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-03-04 16:54:11,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:54:11,091 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-03-04 16:54:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:11,092 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:54:11,092 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:54:11,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:54:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:54:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-03-04 16:54:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:54:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-03-04 16:54:11,098 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-03-04 16:54:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:11,098 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-03-04 16:54:11,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:54:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-03-04 16:54:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-03-04 16:54:11,099 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:11,099 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-03-04 16:54:11,099 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-03-04 16:54:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:11,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:11,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:11,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,958 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-03-04 16:54:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:11,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:12,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:12,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:12,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:54:12,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:12,046 INFO L453 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-03-04 16:54:12,047 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,135 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:15,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:15,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-03-04 16:54:15,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:15,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:54:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:54:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:54:15,665 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-03-04 16:54:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:15,998 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-03-04 16:54:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:54:15,998 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-03-04 16:54:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:15,999 INFO L225 Difference]: With dead ends: 143 [2019-03-04 16:54:16,000 INFO L226 Difference]: Without dead ends: 142 [2019-03-04 16:54:16,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:54:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-03-04 16:54:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-03-04 16:54:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:54:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-03-04 16:54:16,005 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-03-04 16:54:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:16,005 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-03-04 16:54:16,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:54:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-03-04 16:54:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-03-04 16:54:16,006 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:16,006 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-03-04 16:54:16,006 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-03-04 16:54:16,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:16,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:16,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:16,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:16,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,731 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-03-04 16:54:16,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:16,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:16,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 112 conjunts are in the unsatisfiable core [2019-03-04 16:54:16,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:16,789 INFO L453 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-03-04 16:54:16,789 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,800 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:19,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-03-04 16:54:19,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:19,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:54:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:54:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:54:19,286 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-03-04 16:54:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:19,774 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-03-04 16:54:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:54:19,775 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-03-04 16:54:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:19,776 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:54:19,776 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:54:19,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:54:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:54:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-03-04 16:54:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:54:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-03-04 16:54:19,781 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-03-04 16:54:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:19,782 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-03-04 16:54:19,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:54:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-03-04 16:54:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-03-04 16:54:19,783 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:19,783 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-03-04 16:54:19,783 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-03-04 16:54:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:19,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:19,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:20,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:20,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:20,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:20,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:20,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:20,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 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-03-04 16:54:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:20,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:20,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:54:20,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:20,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:54:20,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:20,856 INFO L453 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-03-04 16:54:20,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:20,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:20,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:23,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-03-04 16:54:23,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:23,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:54:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:54:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:54:23,397 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-03-04 16:54:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:23,793 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-03-04 16:54:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:54:23,793 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-03-04 16:54:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:23,795 INFO L225 Difference]: With dead ends: 151 [2019-03-04 16:54:23,795 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:54:23,796 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-03-04 16:54:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:54:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-03-04 16:54:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:54:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-03-04 16:54:23,800 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-03-04 16:54:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:23,801 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-03-04 16:54:23,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:54:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-03-04 16:54:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-03-04 16:54:23,802 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:23,802 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-03-04 16:54:23,802 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-03-04 16:54:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:23,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:23,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:24,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:24,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:24,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,667 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-03-04 16:54:24,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:24,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:24,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:24,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:24,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:54:24,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:24,781 INFO L453 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-03-04 16:54:24,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,882 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:28,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:28,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-03-04 16:54:28,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:28,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:54:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:54:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:54:28,048 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-03-04 16:54:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:28,370 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-03-04 16:54:28,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:54:28,370 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-03-04 16:54:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:28,372 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:54:28,372 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:54:28,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:54:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:54:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-03-04 16:54:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-03-04 16:54:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-03-04 16:54:28,378 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-03-04 16:54:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:28,379 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-03-04 16:54:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:54:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-03-04 16:54:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-03-04 16:54:28,380 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:28,380 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-03-04 16:54:28,380 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-03-04 16:54:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:30,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:30,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:30,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:30,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:30,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:30,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 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-03-04 16:54:30,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:30,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:30,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:54:30,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:30,609 INFO L453 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-03-04 16:54:30,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:30,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:31,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:33,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-03-04 16:54:33,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:33,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:54:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:54:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:54:33,666 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-03-04 16:54:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:33,914 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-03-04 16:54:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:54:33,914 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-03-04 16:54:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:33,916 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:54:33,916 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:54:33,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:54:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:54:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-03-04 16:54:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:54:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-03-04 16:54:33,922 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-03-04 16:54:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-03-04 16:54:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:54:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-03-04 16:54:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:54:33,923 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:33,924 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-03-04 16:54:33,924 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-03-04 16:54:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:36,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:36,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:36,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:36,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:36,570 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-03-04 16:54:36,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:36,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:36,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-03-04 16:54:36,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:36,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:54:36,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:36,714 INFO L453 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-03-04 16:54:36,714 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:36,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:37,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:39,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-03-04 16:54:39,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:39,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:54:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:54:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:54:39,785 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-03-04 16:54:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:40,582 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-03-04 16:54:40,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:54:40,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-03-04 16:54:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:40,584 INFO L225 Difference]: With dead ends: 163 [2019-03-04 16:54:40,584 INFO L226 Difference]: Without dead ends: 162 [2019-03-04 16:54:40,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:54:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-03-04 16:54:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-03-04 16:54:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:54:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-03-04 16:54:40,590 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-03-04 16:54:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:40,590 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-03-04 16:54:40,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:54:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-03-04 16:54:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:54:40,591 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:40,591 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-03-04 16:54:40,591 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-03-04 16:54:40,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:42,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:42,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:42,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:42,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:42,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:42,119 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-03-04 16:54:42,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:42,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:42,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:42,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:42,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:54:42,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:42,183 INFO L453 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-03-04 16:54:42,184 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:42,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:42,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:43,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-03-04 16:54:45,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:54:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:54:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:54:45,286 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-03-04 16:54:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:45,677 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-03-04 16:54:45,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:54:45,678 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-03-04 16:54:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:45,679 INFO L225 Difference]: With dead ends: 167 [2019-03-04 16:54:45,679 INFO L226 Difference]: Without dead ends: 166 [2019-03-04 16:54:45,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:54:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-03-04 16:54:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-03-04 16:54:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-03-04 16:54:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-03-04 16:54:45,686 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-03-04 16:54:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:45,687 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-03-04 16:54:45,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:54:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-03-04 16:54:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-03-04 16:54:45,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:45,688 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-03-04 16:54:45,688 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-03-04 16:54:45,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:46,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:46,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,697 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-03-04 16:54:46,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:46,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 130 conjunts are in the unsatisfiable core [2019-03-04 16:54:46,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:46,787 INFO L453 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-03-04 16:54:46,787 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:47,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:50,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-03-04 16:54:50,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:50,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:54:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:54:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:54:50,133 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-03-04 16:54:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:50,417 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-03-04 16:54:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:54:50,418 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-03-04 16:54:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:50,419 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:54:50,419 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:54:50,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:54:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:54:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-03-04 16:54:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-03-04 16:54:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-03-04 16:54:50,424 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-03-04 16:54:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:50,424 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-03-04 16:54:50,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:54:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-03-04 16:54:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-03-04 16:54:50,425 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:50,425 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-03-04 16:54:50,426 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-03-04 16:54:50,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:50,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:50,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:51,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:51,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,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 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-03-04 16:54:51,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:51,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:51,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-03-04 16:54:51,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:51,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:54:51,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:51,955 INFO L453 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-03-04 16:54:51,956 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:52,038 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:52,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-03-04 16:54:55,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:55,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:54:55,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:54:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:54:55,537 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-03-04 16:54:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:55,884 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-03-04 16:54:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:54:55,884 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-03-04 16:54:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:55,885 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:54:55,885 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:54:55,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:54:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:54:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-03-04 16:54:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-03-04 16:54:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-03-04 16:54:55,892 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-03-04 16:54:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:55,892 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-03-04 16:54:55,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:54:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-03-04 16:54:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-03-04 16:54:55,893 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:55,893 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-03-04 16:54:55,893 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-03-04 16:54:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:55,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:55,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:57,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:57,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:57,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:57,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:57,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:57,655 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-03-04 16:54:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:57,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:57,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:57,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:57,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:54:57,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:57,726 INFO L453 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-03-04 16:54:57,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:57,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:57,738 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-03-04 16:55:01,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:01,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:55:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:55:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:55:01,634 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-03-04 16:55:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:02,207 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-03-04 16:55:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:55:02,207 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-03-04 16:55:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:02,208 INFO L225 Difference]: With dead ends: 179 [2019-03-04 16:55:02,208 INFO L226 Difference]: Without dead ends: 178 [2019-03-04 16:55:02,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:55:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-03-04 16:55:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-03-04 16:55:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-03-04 16:55:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-03-04 16:55:02,216 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-03-04 16:55:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:02,216 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-03-04 16:55:02,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:55:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-03-04 16:55:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-03-04 16:55:02,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:02,217 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-03-04 16:55:02,217 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-03-04 16:55:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:02,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:02,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:03,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:03,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:03,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:03,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:03,317 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-03-04 16:55:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:03,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:03,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:55:03,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:03,389 INFO L453 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-03-04 16:55:03,389 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,403 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:07,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-03-04 16:55:07,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:07,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:55:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:55:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:55:07,495 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-03-04 16:55:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:07,817 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-03-04 16:55:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:55:07,818 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-03-04 16:55:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:07,820 INFO L225 Difference]: With dead ends: 183 [2019-03-04 16:55:07,820 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:55:07,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:55:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:55:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-03-04 16:55:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:55:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:55:07,826 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-03-04 16:55:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:07,826 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:55:07,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:55:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:55:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:55:07,827 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:07,827 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-03-04 16:55:07,827 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-03-04 16:55:07,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:08,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:08,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:08,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:08,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:08,916 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-03-04 16:55:08,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:08,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:09,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-03-04 16:55:09,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:09,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:55:09,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:09,100 INFO L453 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-03-04 16:55:09,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,108 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-03-04 16:55:13,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:13,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:55:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:55:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:55:13,150 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-03-04 16:55:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:13,500 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-03-04 16:55:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:55:13,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-03-04 16:55:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:13,502 INFO L225 Difference]: With dead ends: 187 [2019-03-04 16:55:13,502 INFO L226 Difference]: Without dead ends: 186 [2019-03-04 16:55:13,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:55:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-03-04 16:55:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-03-04 16:55:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:55:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-03-04 16:55:13,508 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-03-04 16:55:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-03-04 16:55:13,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:55:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-03-04 16:55:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-03-04 16:55:13,510 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:13,510 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-03-04 16:55:13,510 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-03-04 16:55:13,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:13,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:13,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:14,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:14,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:14,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:14,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,943 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-03-04 16:55:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:14,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:15,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:15,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:15,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:55:15,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:15,023 INFO L453 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-03-04 16:55:15,023 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,033 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:19,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-03-04 16:55:19,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:19,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:55:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:55:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:55:19,400 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-03-04 16:55:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:19,735 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-03-04 16:55:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:55:19,736 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-03-04 16:55:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:19,737 INFO L225 Difference]: With dead ends: 191 [2019-03-04 16:55:19,737 INFO L226 Difference]: Without dead ends: 190 [2019-03-04 16:55:19,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:55:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-03-04 16:55:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-03-04 16:55:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-03-04 16:55:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-03-04 16:55:19,743 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-03-04 16:55:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:19,744 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-03-04 16:55:19,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:55:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-03-04 16:55:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-03-04 16:55:19,744 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:19,745 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-03-04 16:55:19,745 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-03-04 16:55:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:19,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:19,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:21,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:21,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:21,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:21,760 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-03-04 16:55:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:21,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:21,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 148 conjunts are in the unsatisfiable core [2019-03-04 16:55:21,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:21,828 INFO L453 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-03-04 16:55:21,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:21,839 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:21,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:27,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-03-04 16:55:27,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:27,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:55:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:55:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:55:27,435 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-03-04 16:55:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:27,801 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:55:27,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:55:27,802 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-03-04 16:55:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:27,804 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:55:27,804 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:55:27,806 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-03-04 16:55:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:55:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-03-04 16:55:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:55:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-03-04 16:55:27,811 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-03-04 16:55:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:27,811 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-03-04 16:55:27,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:55:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-03-04 16:55:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-03-04 16:55:27,812 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:27,812 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-03-04 16:55:27,813 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-03-04 16:55:27,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:27,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:27,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:27,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:27,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:29,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:29,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:29,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:29,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:29,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:29,262 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-03-04 16:55:29,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:29,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:29,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-03-04 16:55:29,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:29,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:55:29,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:29,484 INFO L453 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-03-04 16:55:29,485 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:29,579 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:29,580 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:31,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:34,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-03-04 16:55:34,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:34,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:55:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:55:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:55:34,266 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-03-04 16:55:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:34,624 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-03-04 16:55:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:55:34,625 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-03-04 16:55:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:34,626 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:55:34,626 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:55:34,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:55:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:55:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-03-04 16:55:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-03-04 16:55:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-03-04 16:55:34,632 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-03-04 16:55:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:34,632 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-03-04 16:55:34,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:55:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-03-04 16:55:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-03-04 16:55:34,633 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:34,633 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-03-04 16:55:34,633 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-03-04 16:55:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:34,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:34,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:35,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:35,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:35,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:35,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:35,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:35,911 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-03-04 16:55:35,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:35,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:35,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:35,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:35,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:55:35,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:35,986 INFO L453 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-03-04 16:55:35,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:35,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:35,996 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:37,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:40,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:40,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-03-04 16:55:40,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:40,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:55:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:55:40,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:55:40,713 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-03-04 16:55:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:41,094 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-03-04 16:55:41,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:55:41,094 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-03-04 16:55:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:41,096 INFO L225 Difference]: With dead ends: 203 [2019-03-04 16:55:41,096 INFO L226 Difference]: Without dead ends: 202 [2019-03-04 16:55:41,098 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-03-04 16:55:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-03-04 16:55:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-03-04 16:55:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-03-04 16:55:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-03-04 16:55:41,104 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-03-04 16:55:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:41,104 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-03-04 16:55:41,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:55:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-03-04 16:55:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-03-04 16:55:41,105 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:41,105 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-03-04 16:55:41,106 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-03-04 16:55:41,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:41,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:41,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:41,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:41,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:42,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:42,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:42,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:42,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:42,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:42,862 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-03-04 16:55:42,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:42,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:42,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:55:42,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:42,940 INFO L453 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-03-04 16:55:42,940 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:42,954 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:42,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:47,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:47,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-03-04 16:55:47,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:47,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:55:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:55:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:55:47,993 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-03-04 16:55:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:48,323 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-03-04 16:55:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:55:48,328 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-03-04 16:55:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:48,330 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:55:48,330 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:55:48,330 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-03-04 16:55:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:55:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-03-04 16:55:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-03-04 16:55:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-03-04 16:55:48,335 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-03-04 16:55:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:48,336 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-03-04 16:55:48,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:55:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-03-04 16:55:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-03-04 16:55:48,337 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:48,337 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-03-04 16:55:48,337 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-03-04 16:55:48,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:48,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:48,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:49,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:49,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:49,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,645 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-03-04 16:55:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:49,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:49,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-03-04 16:55:49,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:49,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:55:49,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:49,854 INFO L453 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-03-04 16:55:49,854 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,866 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,866 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:51,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-03-04 16:55:55,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:55,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:55:55,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:55:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:55:55,021 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-03-04 16:55:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:55,401 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-03-04 16:55:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:55:55,401 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-03-04 16:55:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:55,403 INFO L225 Difference]: With dead ends: 211 [2019-03-04 16:55:55,403 INFO L226 Difference]: Without dead ends: 210 [2019-03-04 16:55:55,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:55:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-03-04 16:55:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-03-04 16:55:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-03-04 16:55:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-03-04 16:55:55,409 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-03-04 16:55:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:55,409 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-03-04 16:55:55,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:55:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-03-04 16:55:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-03-04 16:55:55,410 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:55,411 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-03-04 16:55:55,411 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-03-04 16:55:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:58,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:58,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:58,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:58,342 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-03-04 16:55:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:58,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:58,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:58,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:58,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:55:58,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:58,461 INFO L453 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-03-04 16:55:58,462 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,543 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,543 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:01,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:04,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:04,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-03-04 16:56:04,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:04,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:56:04,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:56:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:56:04,734 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-03-04 16:56:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:05,179 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-03-04 16:56:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:56:05,179 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-03-04 16:56:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:05,181 INFO L225 Difference]: With dead ends: 215 [2019-03-04 16:56:05,181 INFO L226 Difference]: Without dead ends: 214 [2019-03-04 16:56:05,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:56:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-03-04 16:56:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-03-04 16:56:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:56:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-03-04 16:56:05,189 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-03-04 16:56:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:05,190 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-03-04 16:56:05,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:56:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-03-04 16:56:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-03-04 16:56:05,191 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:05,191 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-03-04 16:56:05,191 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-03-04 16:56:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:05,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:05,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:06,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:06,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:06,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:06,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:06,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:06,638 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-03-04 16:56:06,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:06,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:06,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 166 conjunts are in the unsatisfiable core [2019-03-04 16:56:06,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:06,738 INFO L453 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-03-04 16:56:06,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,775 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:06,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:08,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:12,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:12,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-03-04 16:56:12,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:12,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:56:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:56:12,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:56:12,081 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-03-04 16:56:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:12,471 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-03-04 16:56:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:56:12,471 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-03-04 16:56:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:12,473 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:56:12,473 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:56:12,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:56:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:56:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-03-04 16:56:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:56:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-03-04 16:56:12,478 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-03-04 16:56:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:12,479 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-03-04 16:56:12,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:56:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-03-04 16:56:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:56:12,480 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:12,480 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-03-04 16:56:12,480 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-03-04 16:56:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:12,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:14,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:14,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:14,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:14,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:14,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:14,172 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-03-04 16:56:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:14,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:14,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-03-04 16:56:14,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:14,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:56:14,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:14,398 INFO L453 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-03-04 16:56:14,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:14,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:14,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:16,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:19,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:19,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-03-04 16:56:19,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:19,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:56:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:56:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:56:19,773 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-03-04 16:56:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:20,163 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-03-04 16:56:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:56:20,164 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-03-04 16:56:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:20,165 INFO L225 Difference]: With dead ends: 223 [2019-03-04 16:56:20,165 INFO L226 Difference]: Without dead ends: 222 [2019-03-04 16:56:20,166 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-03-04 16:56:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-03-04 16:56:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-03-04 16:56:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:56:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-03-04 16:56:20,170 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-03-04 16:56:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:20,171 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-03-04 16:56:20,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:56:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-03-04 16:56:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-03-04 16:56:20,172 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:20,172 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-03-04 16:56:20,172 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:20,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-03-04 16:56:20,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:20,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:20,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:21,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:21,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:21,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:21,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:21,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:21,716 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-03-04 16:56:21,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:21,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:21,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:21,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:21,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:56:21,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:21,798 INFO L453 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-03-04 16:56:21,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:23,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:27,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:27,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-03-04 16:56:27,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:27,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:56:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:56:27,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:56:27,117 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-03-04 16:56:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:27,579 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-03-04 16:56:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:56:27,580 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-03-04 16:56:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:27,581 INFO L225 Difference]: With dead ends: 227 [2019-03-04 16:56:27,582 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:56:27,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:56:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:56:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-03-04 16:56:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:56:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-03-04 16:56:27,588 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-03-04 16:56:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:27,589 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-03-04 16:56:27,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:56:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-03-04 16:56:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-03-04 16:56:27,590 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:27,590 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-03-04 16:56:27,590 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-03-04 16:56:27,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:27,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:27,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:29,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:29,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:29,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:29,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,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 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-03-04 16:56:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:29,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:29,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:56:29,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:29,502 INFO L453 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-03-04 16:56:29,502 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:31,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:34,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-03-04 16:56:34,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:34,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-03-04 16:56:34,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:34,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:56:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:56:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:56:34,985 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-03-04 16:56:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:35,485 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-03-04 16:56:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:56:35,485 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-03-04 16:56:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:35,487 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:56:35,487 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:56:35,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:56:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:56:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-03-04 16:56:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:56:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-03-04 16:56:35,494 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-03-04 16:56:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:35,494 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-03-04 16:56:35,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:56:35,495 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-03-04 16:56:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-03-04 16:56:35,496 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:35,496 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-03-04 16:56:35,496 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-03-04 16:56:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:35,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:37,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:37,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:37,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:37,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:37,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:37,096 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-03-04 16:56:37,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:37,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:37,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-03-04 16:56:37,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:37,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:56:37,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:37,359 INFO L453 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-03-04 16:56:37,359 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,368 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:39,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:43,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:43,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-03-04 16:56:43,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:43,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:56:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:56:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:56:43,116 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-03-04 16:56:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:43,698 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-03-04 16:56:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:56:43,698 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-03-04 16:56:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:43,700 INFO L225 Difference]: With dead ends: 235 [2019-03-04 16:56:43,700 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:56:43,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:56:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:56:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-03-04 16:56:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-03-04 16:56:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-03-04 16:56:43,706 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-03-04 16:56:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:43,706 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-03-04 16:56:43,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:56:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-03-04 16:56:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-03-04 16:56:43,708 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:43,708 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-03-04 16:56:43,708 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-03-04 16:56:43,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:43,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:43,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:45,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:45,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:45,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:45,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:45,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:45,376 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-03-04 16:56:45,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:45,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:45,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:45,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:45,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:56:45,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:45,466 INFO L453 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-03-04 16:56:45,466 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:45,477 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:45,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:47,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:51,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:51,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-03-04 16:56:51,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:51,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:56:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:56:51,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:56:51,509 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-03-04 16:56:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:51,986 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-03-04 16:56:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:56:51,986 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-03-04 16:56:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:51,988 INFO L225 Difference]: With dead ends: 239 [2019-03-04 16:56:51,988 INFO L226 Difference]: Without dead ends: 238 [2019-03-04 16:56:51,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:56:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-03-04 16:56:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-03-04 16:56:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-03-04 16:56:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-03-04 16:56:51,994 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-03-04 16:56:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:51,994 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-03-04 16:56:51,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:56:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-03-04 16:56:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-03-04 16:56:51,995 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:51,995 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-03-04 16:56:51,995 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-03-04 16:56:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:51,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:51,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:54,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:54,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:54,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:54,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:54,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:54,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 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-03-04 16:56:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:54,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:54,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 184 conjunts are in the unsatisfiable core [2019-03-04 16:56:54,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:54,181 INFO L453 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-03-04 16:56:54,181 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,190 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:56,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:59,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:59,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-03-04 16:56:59,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:59,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:56:59,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:56:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:56:59,843 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-03-04 16:57:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:00,321 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-03-04 16:57:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:57:00,321 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-03-04 16:57:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:00,322 INFO L225 Difference]: With dead ends: 243 [2019-03-04 16:57:00,322 INFO L226 Difference]: Without dead ends: 242 [2019-03-04 16:57:00,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:57:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-03-04 16:57:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-03-04 16:57:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:57:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:57:00,328 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-03-04 16:57:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:00,328 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:57:00,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:57:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:57:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:57:00,329 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:00,329 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-03-04 16:57:00,330 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-03-04 16:57:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:00,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:02,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:02,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:02,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:02,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:02,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:02,208 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-03-04 16:57:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:02,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:02,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-03-04 16:57:02,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:02,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:57:02,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:02,470 INFO L453 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-03-04 16:57:02,470 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,478 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:04,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:08,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-03-04 16:57:08,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:08,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:57:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:57:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:57:08,539 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-03-04 16:57:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:09,083 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-03-04 16:57:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:57:09,084 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-03-04 16:57:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:09,085 INFO L225 Difference]: With dead ends: 247 [2019-03-04 16:57:09,085 INFO L226 Difference]: Without dead ends: 246 [2019-03-04 16:57:09,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:57:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-03-04 16:57:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-03-04 16:57:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 16:57:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-03-04 16:57:09,091 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-03-04 16:57:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:09,092 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-03-04 16:57:09,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:57:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-03-04 16:57:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-03-04 16:57:09,093 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:09,093 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-03-04 16:57:09,094 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-03-04 16:57:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:09,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:09,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:09,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:09,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:10,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:10,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:10,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:10,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:10,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:10,955 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-03-04 16:57:10,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:10,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:11,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:11,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:11,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:57:11,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:11,091 INFO L453 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-03-04 16:57:11,092 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:11,133 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:11,133 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:13,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:17,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:17,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-03-04 16:57:17,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:17,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:57:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:57:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:57:17,496 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-03-04 16:57:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:17,996 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-03-04 16:57:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:57:17,997 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-03-04 16:57:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:17,998 INFO L225 Difference]: With dead ends: 251 [2019-03-04 16:57:17,998 INFO L226 Difference]: Without dead ends: 250 [2019-03-04 16:57:17,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:57:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-03-04 16:57:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-03-04 16:57:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-03-04 16:57:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-03-04 16:57:18,005 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-03-04 16:57:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:18,005 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-03-04 16:57:18,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:57:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-03-04 16:57:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-03-04 16:57:18,007 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:18,007 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-03-04 16:57:18,007 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-03-04 16:57:18,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:20,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:20,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:20,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:20,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:20,241 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-03-04 16:57:20,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:20,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:20,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:57:20,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:20,329 INFO L453 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-03-04 16:57:20,330 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:20,341 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:20,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:22,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:26,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-03-04 16:57:26,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:26,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:57:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:57:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:57:26,348 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-03-04 16:57:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:26,798 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:57:26,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:57:26,799 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-03-04 16:57:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:26,800 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:57:26,800 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:57:26,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:57:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:57:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-03-04 16:57:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 16:57:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-03-04 16:57:26,806 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-03-04 16:57:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:26,806 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-03-04 16:57:26,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:57:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-03-04 16:57:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-03-04 16:57:26,807 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:26,807 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-03-04 16:57:26,807 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-03-04 16:57:26,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:26,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:26,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:28,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:28,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:28,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:28,756 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-03-04 16:57:28,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:28,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:29,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-03-04 16:57:29,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:29,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:57:29,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:29,058 INFO L453 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-03-04 16:57:29,058 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:29,066 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:29,066 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:31,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-03-04 16:57:35,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:35,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:57:35,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:57:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:57:35,563 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-03-04 16:57:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:36,016 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-03-04 16:57:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:57:36,017 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-03-04 16:57:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:36,018 INFO L225 Difference]: With dead ends: 259 [2019-03-04 16:57:36,018 INFO L226 Difference]: Without dead ends: 258 [2019-03-04 16:57:36,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:57:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-03-04 16:57:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-03-04 16:57:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-03-04 16:57:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-03-04 16:57:36,023 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-03-04 16:57:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:36,023 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-03-04 16:57:36,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:57:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-03-04 16:57:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-03-04 16:57:36,024 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:36,025 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-03-04 16:57:36,025 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-03-04 16:57:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:36,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:36,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:38,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:38,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:38,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:38,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:38,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:38,053 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-03-04 16:57:38,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:38,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:38,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:38,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:38,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:57:38,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:38,155 INFO L453 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-03-04 16:57:38,155 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:38,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:38,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:40,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:44,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:44,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-03-04 16:57:44,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:44,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:57:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:57:44,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:57:44,431 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-03-04 16:57:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:44,989 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-03-04 16:57:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:57:44,989 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-03-04 16:57:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:44,991 INFO L225 Difference]: With dead ends: 263 [2019-03-04 16:57:44,991 INFO L226 Difference]: Without dead ends: 262 [2019-03-04 16:57:44,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:57:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-03-04 16:57:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-03-04 16:57:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-03-04 16:57:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-03-04 16:57:44,999 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-03-04 16:57:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:44,999 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-03-04 16:57:44,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:57:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-03-04 16:57:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-03-04 16:57:45,000 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:45,001 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-03-04 16:57:45,001 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-03-04 16:57:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:45,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:45,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:47,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:47,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:47,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:47,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:47,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:47,132 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-03-04 16:57:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:47,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:47,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 202 conjunts are in the unsatisfiable core [2019-03-04 16:57:47,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:47,238 INFO L453 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-03-04 16:57:47,238 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,247 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:49,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-03-04 16:57:53,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:53,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:57:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:57:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:57:53,591 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-03-04 16:57:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:54,074 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-03-04 16:57:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:57:54,074 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-03-04 16:57:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:54,076 INFO L225 Difference]: With dead ends: 267 [2019-03-04 16:57:54,076 INFO L226 Difference]: Without dead ends: 266 [2019-03-04 16:57:54,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:57:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-03-04 16:57:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-03-04 16:57:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-03-04 16:57:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-03-04 16:57:54,082 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-03-04 16:57:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:54,083 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-03-04 16:57:54,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:57:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-03-04 16:57:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-03-04 16:57:54,084 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:54,084 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-03-04 16:57:54,085 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-03-04 16:57:54,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:54,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:56,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:56,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:56,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:56,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:56,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:56,374 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-03-04 16:57:56,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:56,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:56,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-03-04 16:57:56,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:56,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:57:56,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:56,707 INFO L453 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-03-04 16:57:56,707 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,720 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:59,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:03,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:03,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-03-04 16:58:03,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:03,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:58:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:58:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:58:03,142 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-03-04 16:58:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:03,708 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-03-04 16:58:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:58:03,709 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-03-04 16:58:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:03,711 INFO L225 Difference]: With dead ends: 271 [2019-03-04 16:58:03,711 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:58:03,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:58:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:58:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-03-04 16:58:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-03-04 16:58:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-03-04 16:58:03,718 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-03-04 16:58:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:03,718 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-03-04 16:58:03,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:58:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-03-04 16:58:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-03-04 16:58:03,720 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:03,720 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-03-04 16:58:03,720 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-03-04 16:58:03,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:03,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:03,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:05,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:05,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:05,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:05,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:05,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:05,919 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-03-04 16:58:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:05,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:06,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:06,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:06,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:58:06,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:06,023 INFO L453 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-03-04 16:58:06,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:06,034 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:06,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:08,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:12,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:12,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-03-04 16:58:12,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:58:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:58:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:58:12,422 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-03-04 16:58:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:12,932 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-03-04 16:58:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:58:12,933 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-03-04 16:58:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:12,934 INFO L225 Difference]: With dead ends: 275 [2019-03-04 16:58:12,934 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:58:12,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:58:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:58:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-03-04 16:58:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 16:58:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-03-04 16:58:12,939 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-03-04 16:58:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:12,940 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-03-04 16:58:12,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:58:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-03-04 16:58:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-03-04 16:58:12,941 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:12,941 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-03-04 16:58:12,941 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-03-04 16:58:12,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:12,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:12,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:15,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:15,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:15,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:15,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:15,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:15,117 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-03-04 16:58:15,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:15,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:15,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:58:15,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:15,209 INFO L453 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-03-04 16:58:15,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:15,219 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:15,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:18,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-03-04 16:58:21,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:21,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:58:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:58:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:58:21,966 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-03-04 16:58:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:22,558 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-03-04 16:58:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:58:22,559 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-03-04 16:58:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:22,560 INFO L225 Difference]: With dead ends: 279 [2019-03-04 16:58:22,560 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:58:22,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:58:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:58:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-03-04 16:58:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-03-04 16:58:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-03-04 16:58:22,567 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-03-04 16:58:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:22,568 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-03-04 16:58:22,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:58:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-03-04 16:58:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-03-04 16:58:22,569 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:22,569 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-03-04 16:58:22,569 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-03-04 16:58:22,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:22,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:24,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:24,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:24,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:24,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:24,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:24,851 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-03-04 16:58:24,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:24,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:25,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-03-04 16:58:25,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:25,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:58:25,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:25,200 INFO L453 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-03-04 16:58:25,200 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:25,208 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:25,208 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:28,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:31,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:31,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-03-04 16:58:31,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:31,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:58:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:58:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:58:31,855 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-03-04 16:58:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:32,392 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-03-04 16:58:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:58:32,393 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-03-04 16:58:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:32,395 INFO L225 Difference]: With dead ends: 283 [2019-03-04 16:58:32,395 INFO L226 Difference]: Without dead ends: 282 [2019-03-04 16:58:32,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:58:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-03-04 16:58:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-03-04 16:58:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-03-04 16:58:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-03-04 16:58:32,403 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-03-04 16:58:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:32,404 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-03-04 16:58:32,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:58:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-03-04 16:58:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-03-04 16:58:32,406 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:32,406 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-03-04 16:58:32,406 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-03-04 16:58:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:32,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:32,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:32,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:34,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:34,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:34,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:34,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:34,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:34,883 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-03-04 16:58:34,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:34,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:34,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:34,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:34,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 16:58:34,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:34,985 INFO L453 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-03-04 16:58:34,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:34,996 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:37,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:41,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:41,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-03-04 16:58:41,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:41,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:58:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:58:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:58:41,690 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-03-04 16:58:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:42,237 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-03-04 16:58:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:58:42,237 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-03-04 16:58:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:42,238 INFO L225 Difference]: With dead ends: 287 [2019-03-04 16:58:42,238 INFO L226 Difference]: Without dead ends: 286 [2019-03-04 16:58:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:58:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-03-04 16:58:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-03-04 16:58:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-03-04 16:58:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-03-04 16:58:42,244 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-03-04 16:58:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:42,244 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-03-04 16:58:42,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:58:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-03-04 16:58:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-03-04 16:58:42,245 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:42,245 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-03-04 16:58:42,245 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-03-04 16:58:42,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:42,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:42,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:44,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:44,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:44,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:44,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:44,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:44,683 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-03-04 16:58:44,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:44,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:44,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 220 conjunts are in the unsatisfiable core [2019-03-04 16:58:44,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:44,782 INFO L453 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-03-04 16:58:44,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:44,790 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:44,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:47,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:51,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:51,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-03-04 16:58:51,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:51,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:58:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:58:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:58:51,787 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-03-04 16:58:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:52,344 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-03-04 16:58:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:58:52,344 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-03-04 16:58:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:52,346 INFO L225 Difference]: With dead ends: 291 [2019-03-04 16:58:52,346 INFO L226 Difference]: Without dead ends: 290 [2019-03-04 16:58:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:58:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-03-04 16:58:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-03-04 16:58:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-03-04 16:58:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-03-04 16:58:52,351 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-03-04 16:58:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-03-04 16:58:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:58:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-03-04 16:58:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-03-04 16:58:52,353 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:52,353 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-03-04 16:58:52,353 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-03-04 16:58:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:52,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:52,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:54,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:54,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:54,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:54,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:54,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:54,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 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-03-04 16:58:54,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:54,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:55,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-03-04 16:58:55,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:55,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:58:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:55,185 INFO L453 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-03-04 16:58:55,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:55,193 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:55,193 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:58,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:02,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:02,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-03-04 16:59:02,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:02,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:59:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:59:02,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:59:02,110 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-03-04 16:59:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:02,689 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-03-04 16:59:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:59:02,690 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-03-04 16:59:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:02,691 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:59:02,692 INFO L226 Difference]: Without dead ends: 294 [2019-03-04 16:59:02,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:59:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-03-04 16:59:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-03-04 16:59:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-03-04 16:59:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-03-04 16:59:02,697 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-03-04 16:59:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:02,697 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-03-04 16:59:02,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:59:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-03-04 16:59:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-03-04 16:59:02,699 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:02,699 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-03-04 16:59:02,700 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-03-04 16:59:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:02,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:02,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:05,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:05,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:05,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:05,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:05,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:05,164 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-03-04 16:59:05,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:05,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:05,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:05,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:05,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:59:05,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:05,306 INFO L453 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-03-04 16:59:05,307 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:05,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:05,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:08,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:12,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:12,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-03-04 16:59:12,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:12,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:59:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:59:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:59:12,571 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-03-04 16:59:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:13,230 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-03-04 16:59:13,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:59:13,230 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-03-04 16:59:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:13,232 INFO L225 Difference]: With dead ends: 299 [2019-03-04 16:59:13,232 INFO L226 Difference]: Without dead ends: 298 [2019-03-04 16:59:13,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:59:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-03-04 16:59:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-03-04 16:59:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-03-04 16:59:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-03-04 16:59:13,238 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-03-04 16:59:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:13,239 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-03-04 16:59:13,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:59:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-03-04 16:59:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-03-04 16:59:13,240 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:13,240 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-03-04 16:59:13,240 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-03-04 16:59:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:13,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:13,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:13,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:13,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:15,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:15,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:15,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:15,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:15,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:15,860 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-03-04 16:59:15,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:15,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:15,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:59:15,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:15,960 INFO L453 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-03-04 16:59:15,960 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:15,968 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:15,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:19,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:23,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-03-04 16:59:23,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:23,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:59:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:59:23,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:59:23,228 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-03-04 16:59:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:23,752 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-03-04 16:59:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:59:23,753 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-03-04 16:59:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:23,755 INFO L225 Difference]: With dead ends: 303 [2019-03-04 16:59:23,755 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:59:23,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:59:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:59:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-03-04 16:59:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:59:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:59:23,762 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-03-04 16:59:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:23,762 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:59:23,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:59:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:59:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:59:23,764 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:23,764 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-03-04 16:59:23,764 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-03-04 16:59:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:23,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:26,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:26,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:26,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:26,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:26,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:26,385 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-03-04 16:59:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:26,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:26,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-03-04 16:59:26,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:26,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:59:26,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:26,822 INFO L453 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-03-04 16:59:26,822 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:26,830 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:26,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:30,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:34,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:34,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-03-04 16:59:34,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:34,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:59:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:59:34,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:59:34,259 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-03-04 16:59:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:34,942 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-03-04 16:59:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:59:34,942 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-03-04 16:59:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:34,944 INFO L225 Difference]: With dead ends: 307 [2019-03-04 16:59:34,944 INFO L226 Difference]: Without dead ends: 306 [2019-03-04 16:59:34,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:59:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-03-04 16:59:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-03-04 16:59:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-03-04 16:59:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-03-04 16:59:34,949 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-03-04 16:59:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:34,950 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-03-04 16:59:34,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:59:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-03-04 16:59:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-03-04 16:59:34,951 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:34,951 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-03-04 16:59:34,951 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-03-04 16:59:34,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:34,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:34,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:37,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:37,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:37,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:37,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:37,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:37,718 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-03-04 16:59:37,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:37,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:37,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:37,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:37,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 16:59:37,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:37,832 INFO L453 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-03-04 16:59:37,832 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:37,838 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:37,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:41,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:45,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-03-04 16:59:45,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:45,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:59:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:59:45,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:59:45,322 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-03-04 16:59:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:45,957 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-03-04 16:59:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:59:45,957 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-03-04 16:59:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:45,959 INFO L225 Difference]: With dead ends: 311 [2019-03-04 16:59:45,959 INFO L226 Difference]: Without dead ends: 310 [2019-03-04 16:59:45,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:59:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-03-04 16:59:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-03-04 16:59:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-03-04 16:59:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-03-04 16:59:45,965 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-03-04 16:59:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:45,966 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-03-04 16:59:45,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:59:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-03-04 16:59:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-03-04 16:59:45,967 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:45,967 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-03-04 16:59:45,968 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-03-04 16:59:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:45,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:45,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:48,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:48,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:48,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:48,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:48,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:48,832 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-03-04 16:59:48,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:48,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:48,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 238 conjunts are in the unsatisfiable core [2019-03-04 16:59:48,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:48,937 INFO L453 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-03-04 16:59:48,937 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:48,947 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:48,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:52,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:56,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:56,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-03-04 16:59:56,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:56,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:59:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:59:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:59:56,331 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-03-04 16:59:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:56,917 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-03-04 16:59:56,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:59:56,917 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-03-04 16:59:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:56,918 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:59:56,919 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:59:56,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:59:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:59:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-03-04 16:59:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-03-04 16:59:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-03-04 16:59:56,924 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-03-04 16:59:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:56,924 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-03-04 16:59:56,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:59:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-03-04 16:59:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-03-04 16:59:56,925 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:56,925 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-03-04 16:59:56,925 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-03-04 16:59:56,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:56,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:59,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:59,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:59,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:59,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:59,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:59,744 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-03-04 16:59:59,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:59,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:00,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-03-04 17:00:00,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:00,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 17:00:00,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:00,175 INFO L453 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-03-04 17:00:00,176 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:00,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:00,194 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:03,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:07,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:07,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-03-04 17:00:07,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:07,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 17:00:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 17:00:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 17:00:07,677 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-03-04 17:00:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:08,349 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-03-04 17:00:08,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 17:00:08,349 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-03-04 17:00:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:08,350 INFO L225 Difference]: With dead ends: 319 [2019-03-04 17:00:08,351 INFO L226 Difference]: Without dead ends: 318 [2019-03-04 17:00:08,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 17:00:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-03-04 17:00:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-03-04 17:00:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-03-04 17:00:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-03-04 17:00:08,357 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-03-04 17:00:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:08,357 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-03-04 17:00:08,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 17:00:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-03-04 17:00:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-03-04 17:00:08,358 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:08,358 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-03-04 17:00:08,358 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-03-04 17:00:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:08,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:08,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:11,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:11,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:11,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:11,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:11,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:11,228 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-03-04 17:00:11,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:11,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:11,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:11,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 17:00:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:11,341 INFO L453 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-03-04 17:00:11,342 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:11,350 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:11,350 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:14,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:18,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:18,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-03-04 17:00:18,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:18,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 17:00:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 17:00:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 17:00:18,898 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-03-04 17:00:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:19,547 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-03-04 17:00:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 17:00:19,547 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-03-04 17:00:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:19,549 INFO L225 Difference]: With dead ends: 323 [2019-03-04 17:00:19,549 INFO L226 Difference]: Without dead ends: 322 [2019-03-04 17:00:19,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 17:00:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-03-04 17:00:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-03-04 17:00:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-03-04 17:00:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-03-04 17:00:19,555 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-03-04 17:00:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:19,555 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-03-04 17:00:19,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 17:00:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-03-04 17:00:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-03-04 17:00:19,556 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:19,556 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-03-04 17:00:19,557 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-03-04 17:00:19,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:19,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:19,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:22,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:22,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:22,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:22,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:22,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:22,440 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-03-04 17:00:22,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:22,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:22,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 17:00:22,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:22,540 INFO L453 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-03-04 17:00:22,540 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:22,552 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:22,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:26,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:30,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:30,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-03-04 17:00:30,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:30,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 17:00:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 17:00:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 17:00:30,086 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-03-04 17:00:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:30,734 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-03-04 17:00:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 17:00:30,735 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-03-04 17:00:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:30,736 INFO L225 Difference]: With dead ends: 327 [2019-03-04 17:00:30,736 INFO L226 Difference]: Without dead ends: 326 [2019-03-04 17:00:30,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 17:00:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-03-04 17:00:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-03-04 17:00:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-03-04 17:00:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-03-04 17:00:30,742 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-03-04 17:00:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:30,743 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-03-04 17:00:30,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 17:00:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-03-04 17:00:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-03-04 17:00:30,744 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:30,745 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-03-04 17:00:30,745 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-03-04 17:00:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:30,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:30,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:30,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:30,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:33,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:33,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:33,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:33,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:33,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:33,853 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-03-04 17:00:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:33,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:34,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-03-04 17:00:34,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 17:00:34,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:34,323 INFO L453 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-03-04 17:00:34,323 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:34,334 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:34,334 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:37,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:41,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-03-04 17:00:41,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:42,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 17:00:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 17:00:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 17:00:42,002 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-03-04 17:00:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:42,669 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-03-04 17:00:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 17:00:42,670 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-03-04 17:00:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:42,672 INFO L225 Difference]: With dead ends: 331 [2019-03-04 17:00:42,672 INFO L226 Difference]: Without dead ends: 330 [2019-03-04 17:00:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 17:00:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-03-04 17:00:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-03-04 17:00:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-03-04 17:00:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-03-04 17:00:42,678 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-03-04 17:00:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:42,678 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-03-04 17:00:42,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 17:00:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-03-04 17:00:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-03-04 17:00:42,679 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:42,680 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-03-04 17:00:42,680 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-03-04 17:00:42,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:42,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:42,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:45,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:45,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:45,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:45,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:45,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:45,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 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-03-04 17:00:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:45,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:45,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:45,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:45,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 17:00:45,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:45,844 INFO L453 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-03-04 17:00:45,844 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:45,853 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:45,853 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:49,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-03-04 17:00:53,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:53,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 17:00:53,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 17:00:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:00:53,622 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-03-04 17:00:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:54,312 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-03-04 17:00:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 17:00:54,312 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-03-04 17:00:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:54,314 INFO L225 Difference]: With dead ends: 335 [2019-03-04 17:00:54,314 INFO L226 Difference]: Without dead ends: 334 [2019-03-04 17:00:54,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:00:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-03-04 17:00:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-03-04 17:00:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-03-04 17:00:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-03-04 17:00:54,320 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-03-04 17:00:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:54,320 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-03-04 17:00:54,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 17:00:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-03-04 17:00:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-03-04 17:00:54,321 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:54,321 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-03-04 17:00:54,321 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-03-04 17:00:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:54,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:54,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:57,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:57,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:57,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:57,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:57,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:57,393 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-03-04 17:00:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:57,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:57,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 256 conjunts are in the unsatisfiable core [2019-03-04 17:00:57,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:57,495 INFO L453 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-03-04 17:00:57,495 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:57,505 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:57,505 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:01,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-03-04 17:01:05,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:05,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 17:01:05,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 17:01:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:01:05,440 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-03-04 17:01:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:06,078 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-03-04 17:01:06,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 17:01:06,078 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-03-04 17:01:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:06,079 INFO L225 Difference]: With dead ends: 339 [2019-03-04 17:01:06,079 INFO L226 Difference]: Without dead ends: 338 [2019-03-04 17:01:06,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:01:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-03-04 17:01:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-03-04 17:01:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-03-04 17:01:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-03-04 17:01:06,086 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-03-04 17:01:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:06,086 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-03-04 17:01:06,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 17:01:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-03-04 17:01:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-03-04 17:01:06,087 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:06,087 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-03-04 17:01:06,087 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-03-04 17:01:06,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:09,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:09,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:09,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:09,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:09,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:09,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 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-03-04 17:01:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:01:09,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:01:09,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-03-04 17:01:09,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:09,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 17:01:09,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:09,742 INFO L453 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-03-04 17:01:09,742 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:09,751 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:09,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:13,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:17,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:17,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-03-04 17:01:17,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:17,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 17:01:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 17:01:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 17:01:17,853 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-03-04 17:01:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:18,573 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-03-04 17:01:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 17:01:18,573 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-03-04 17:01:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:18,575 INFO L225 Difference]: With dead ends: 343 [2019-03-04 17:01:18,575 INFO L226 Difference]: Without dead ends: 342 [2019-03-04 17:01:18,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 17:01:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-03-04 17:01:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-03-04 17:01:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-03-04 17:01:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-03-04 17:01:18,581 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-03-04 17:01:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:18,582 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-03-04 17:01:18,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 17:01:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-03-04 17:01:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-03-04 17:01:18,583 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:18,583 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-03-04 17:01:18,583 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-03-04 17:01:18,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:18,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:18,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:18,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:18,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:21,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:21,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:21,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:21,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:21,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:21,817 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-03-04 17:01:21,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:21,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:21,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:21,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:21,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 17:01:21,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:21,942 INFO L453 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-03-04 17:01:21,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:21,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:21,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:25,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:30,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-03-04 17:01:30,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:30,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 17:01:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 17:01:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 17:01:30,038 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-03-04 17:01:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:30,808 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-03-04 17:01:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 17:01:30,809 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-03-04 17:01:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:30,811 INFO L225 Difference]: With dead ends: 347 [2019-03-04 17:01:30,811 INFO L226 Difference]: Without dead ends: 346 [2019-03-04 17:01:30,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 17:01:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-03-04 17:01:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-03-04 17:01:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-03-04 17:01:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-03-04 17:01:30,818 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-03-04 17:01:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:30,818 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-03-04 17:01:30,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 17:01:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-03-04 17:01:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-03-04 17:01:30,820 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:30,821 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-03-04 17:01:30,821 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-03-04 17:01:30,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:30,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:30,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:34,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:34,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:34,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:34,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:34,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 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-03-04 17:01:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:34,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:34,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 17:01:34,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:34,245 INFO L453 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-03-04 17:01:34,245 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:38,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:42,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:42,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-03-04 17:01:42,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:42,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 17:01:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 17:01:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 17:01:42,494 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-03-04 17:01:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:43,235 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-03-04 17:01:43,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 17:01:43,235 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-03-04 17:01:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:43,237 INFO L225 Difference]: With dead ends: 351 [2019-03-04 17:01:43,237 INFO L226 Difference]: Without dead ends: 350 [2019-03-04 17:01:43,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 17:01:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-03-04 17:01:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-03-04 17:01:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-03-04 17:01:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-03-04 17:01:43,243 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-03-04 17:01:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:43,243 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-03-04 17:01:43,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 17:01:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-03-04 17:01:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-03-04 17:01:43,245 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:43,245 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-03-04 17:01:43,245 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-03-04 17:01:43,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:43,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:43,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:46,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:46,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:46,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:46,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:46,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:46,720 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-03-04 17:01:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:01:46,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:01:47,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-03-04 17:01:47,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:47,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 17:01:47,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:47,246 INFO L453 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-03-04 17:01:47,246 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:47,259 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:47,259 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:51,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:55,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-03-04 17:01:55,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:55,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 17:01:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 17:01:55,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 17:01:55,473 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-03-04 17:01:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:56,244 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-03-04 17:01:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 17:01:56,245 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-03-04 17:01:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:56,247 INFO L225 Difference]: With dead ends: 355 [2019-03-04 17:01:56,247 INFO L226 Difference]: Without dead ends: 354 [2019-03-04 17:01:56,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 17:01:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-03-04 17:01:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-03-04 17:01:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-03-04 17:01:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-03-04 17:01:56,254 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-03-04 17:01:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:56,254 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-03-04 17:01:56,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 17:01:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-03-04 17:01:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-03-04 17:01:56,255 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:56,255 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-03-04 17:01:56,255 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-03-04 17:01:56,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:59,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:59,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:59,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:59,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:59,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:59,717 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-03-04 17:01:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:59,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:59,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:59,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:59,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 17:01:59,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:59,850 INFO L453 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-03-04 17:01:59,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:59,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:59,861 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:04,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:08,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-03-04 17:02:08,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:08,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 17:02:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 17:02:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 17:02:08,347 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-03-04 17:02:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:09,015 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-03-04 17:02:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 17:02:09,016 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-03-04 17:02:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:09,017 INFO L225 Difference]: With dead ends: 359 [2019-03-04 17:02:09,017 INFO L226 Difference]: Without dead ends: 358 [2019-03-04 17:02:09,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 17:02:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-03-04 17:02:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-03-04 17:02:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-03-04 17:02:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-03-04 17:02:09,023 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-03-04 17:02:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:09,023 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-03-04 17:02:09,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 17:02:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-03-04 17:02:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-03-04 17:02:09,024 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:09,025 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-03-04 17:02:09,025 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-03-04 17:02:09,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:09,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:09,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:12,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:12,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:12,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:12,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:12,568 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-03-04 17:02:12,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:12,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 274 conjunts are in the unsatisfiable core [2019-03-04 17:02:12,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:12,682 INFO L453 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-03-04 17:02:12,682 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:12,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:12,691 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:17,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:21,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:21,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-03-04 17:02:21,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:21,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 17:02:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 17:02:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 17:02:21,143 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-03-04 17:02:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:21,989 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-03-04 17:02:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 17:02:21,990 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-03-04 17:02:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:21,992 INFO L225 Difference]: With dead ends: 363 [2019-03-04 17:02:21,992 INFO L226 Difference]: Without dead ends: 362 [2019-03-04 17:02:21,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 17:02:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-03-04 17:02:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-03-04 17:02:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-03-04 17:02:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-03-04 17:02:21,999 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-03-04 17:02:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:21,999 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-03-04 17:02:21,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 17:02:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-03-04 17:02:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-03-04 17:02:22,000 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:22,001 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-03-04 17:02:22,001 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:22,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-03-04 17:02:22,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:22,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:22,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:22,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:22,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:25,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:25,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:25,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:25,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:25,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:25,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 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-03-04 17:02:25,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:02:25,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:02:26,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-03-04 17:02:26,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 17:02:26,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:26,299 INFO L453 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-03-04 17:02:26,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:26,305 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:26,306 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:30,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:35,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:35,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-03-04 17:02:35,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:35,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 17:02:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 17:02:35,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 17:02:35,044 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-03-04 17:02:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:35,771 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-03-04 17:02:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 17:02:35,771 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-03-04 17:02:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:35,773 INFO L225 Difference]: With dead ends: 367 [2019-03-04 17:02:35,773 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 17:02:35,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 17:02:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 17:02:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-03-04 17:02:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-03-04 17:02:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-03-04 17:02:35,779 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-03-04 17:02:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-03-04 17:02:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 17:02:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-03-04 17:02:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-03-04 17:02:35,781 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:35,781 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-03-04 17:02:35,781 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-03-04 17:02:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:35,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:35,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:39,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:39,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:39,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:39,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:39,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:39,459 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-03-04 17:02:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:02:39,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:02:39,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:02:39,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:39,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 17:02:39,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:39,591 INFO L453 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-03-04 17:02:39,591 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:39,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:39,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:44,119 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-03-04 17:02:48,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 17:02:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 17:02:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 17:02:48,252 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-03-04 17:02:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:48,956 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-03-04 17:02:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 17:02:48,956 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-03-04 17:02:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:48,958 INFO L225 Difference]: With dead ends: 371 [2019-03-04 17:02:48,958 INFO L226 Difference]: Without dead ends: 370 [2019-03-04 17:02:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 17:02:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-03-04 17:02:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-03-04 17:02:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-03-04 17:02:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-03-04 17:02:48,964 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-03-04 17:02:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:48,964 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-03-04 17:02:48,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 17:02:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-03-04 17:02:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-03-04 17:02:48,965 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:48,965 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-03-04 17:02:48,966 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-03-04 17:02:48,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:48,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:48,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:48,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:48,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:52,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:52,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:52,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:52,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:52,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:52,733 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-03-04 17:02:52,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:52,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:52,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 17:02:52,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:52,850 INFO L453 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-03-04 17:02:52,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:52,863 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:52,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:57,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-03-04 17:03:01,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:01,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 17:03:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 17:03:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 17:03:01,714 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-03-04 17:03:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:02,477 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-03-04 17:03:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 17:03:02,483 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-03-04 17:03:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:02,484 INFO L225 Difference]: With dead ends: 375 [2019-03-04 17:03:02,484 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 17:03:02,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 17:03:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 17:03:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-03-04 17:03:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-03-04 17:03:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-03-04 17:03:02,490 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-03-04 17:03:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:02,490 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-03-04 17:03:02,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 17:03:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-03-04 17:03:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-03-04 17:03:02,492 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:02,492 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-03-04 17:03:02,492 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-03-04 17:03:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:02,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:02,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:06,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:06,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:06,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:06,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:06,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:06,337 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-03-04 17:03:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:06,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:06,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-03-04 17:03:06,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:06,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 17:03:06,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:06,954 INFO L453 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-03-04 17:03:06,954 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:06,963 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:06,963 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:11,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:15,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:15,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-03-04 17:03:15,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:15,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 17:03:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 17:03:15,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 17:03:15,874 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-03-04 17:03:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:16,589 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-03-04 17:03:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 17:03:16,589 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-03-04 17:03:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:16,590 INFO L225 Difference]: With dead ends: 379 [2019-03-04 17:03:16,590 INFO L226 Difference]: Without dead ends: 378 [2019-03-04 17:03:16,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 17:03:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-03-04 17:03:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-03-04 17:03:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-03-04 17:03:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-03-04 17:03:16,597 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-03-04 17:03:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:16,597 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-03-04 17:03:16,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 17:03:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-03-04 17:03:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-03-04 17:03:16,599 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:16,599 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-03-04 17:03:16,599 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-03-04 17:03:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:16,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:16,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:20,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:20,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:20,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:20,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:20,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:20,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 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-03-04 17:03:20,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:03:20,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:03:20,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:03:20,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:20,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 17:03:20,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:20,714 INFO L453 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-03-04 17:03:20,714 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:20,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:20,722 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:25,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:29,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:29,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-03-04 17:03:29,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:29,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 17:03:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 17:03:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 17:03:29,689 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-03-04 17:03:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:30,370 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-03-04 17:03:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 17:03:30,371 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-03-04 17:03:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:30,373 INFO L225 Difference]: With dead ends: 383 [2019-03-04 17:03:30,373 INFO L226 Difference]: Without dead ends: 382 [2019-03-04 17:03:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 17:03:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-03-04 17:03:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-03-04 17:03:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-03-04 17:03:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-03-04 17:03:30,380 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-03-04 17:03:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:30,380 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-03-04 17:03:30,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 17:03:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-03-04 17:03:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-03-04 17:03:30,381 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:30,382 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-03-04 17:03:30,382 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-03-04 17:03:30,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:30,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:30,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:34,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:34,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:34,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:34,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,384 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-03-04 17:03:34,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:34,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:34,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 292 conjunts are in the unsatisfiable core [2019-03-04 17:03:34,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:34,507 INFO L453 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-03-04 17:03:34,507 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,522 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:39,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:43,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-03-04 17:03:43,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:43,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 17:03:43,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 17:03:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 17:03:43,586 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-03-04 17:03:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:44,363 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-03-04 17:03:44,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 17:03:44,363 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-03-04 17:03:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:44,366 INFO L225 Difference]: With dead ends: 387 [2019-03-04 17:03:44,366 INFO L226 Difference]: Without dead ends: 386 [2019-03-04 17:03:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 17:03:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-03-04 17:03:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-03-04 17:03:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-03-04 17:03:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-03-04 17:03:44,373 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-03-04 17:03:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:44,373 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-03-04 17:03:44,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 17:03:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-03-04 17:03:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-03-04 17:03:44,375 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:44,375 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-03-04 17:03:44,375 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-03-04 17:03:44,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:44,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:48,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:48,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:48,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:48,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:48,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:48,564 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-03-04 17:03:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:48,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:49,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-03-04 17:03:49,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:49,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 17:03:49,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:49,207 INFO L453 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-03-04 17:03:49,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:49,216 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:49,217 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:54,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:58,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:58,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-03-04 17:03:58,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:58,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 17:03:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 17:03:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 17:03:58,394 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-03-04 17:03:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:59,260 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-03-04 17:03:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 17:03:59,260 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-03-04 17:03:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:59,262 INFO L225 Difference]: With dead ends: 391 [2019-03-04 17:03:59,262 INFO L226 Difference]: Without dead ends: 390 [2019-03-04 17:03:59,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 17:03:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-03-04 17:03:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-03-04 17:03:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-03-04 17:03:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-03-04 17:03:59,268 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-03-04 17:03:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:59,269 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-03-04 17:03:59,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 17:03:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-03-04 17:03:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-03-04 17:03:59,271 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:59,271 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-03-04 17:03:59,271 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-03-04 17:03:59,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:59,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:59,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:03,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:03,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:03,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:03,770 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-03-04 17:04:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:04:03,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:04:03,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:04:03,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:03,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 17:04:03,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:03,911 INFO L453 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-03-04 17:04:03,911 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:03,919 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:03,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:08,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:13,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-03-04 17:04:13,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:13,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 17:04:13,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 17:04:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 17:04:13,217 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-03-04 17:04:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:14,118 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-03-04 17:04:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 17:04:14,119 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-03-04 17:04:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:14,121 INFO L225 Difference]: With dead ends: 395 [2019-03-04 17:04:14,121 INFO L226 Difference]: Without dead ends: 394 [2019-03-04 17:04:14,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 17:04:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-03-04 17:04:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-03-04 17:04:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-03-04 17:04:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-03-04 17:04:14,129 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-03-04 17:04:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:14,129 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-03-04 17:04:14,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 17:04:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-03-04 17:04:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-03-04 17:04:14,132 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:14,132 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-03-04 17:04:14,132 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-03-04 17:04:14,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:14,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:14,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:18,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:18,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:18,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:18,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:18,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:18,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 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-03-04 17:04:18,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:18,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:18,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 17:04:18,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:18,809 INFO L453 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-03-04 17:04:18,809 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:18,823 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:18,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:24,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:28,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:28,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-03-04 17:04:28,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:28,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 17:04:28,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 17:04:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 17:04:28,319 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-03-04 17:04:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:29,059 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-03-04 17:04:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 17:04:29,060 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-03-04 17:04:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:29,061 INFO L225 Difference]: With dead ends: 399 [2019-03-04 17:04:29,061 INFO L226 Difference]: Without dead ends: 398 [2019-03-04 17:04:29,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 17:04:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-03-04 17:04:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-03-04 17:04:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-03-04 17:04:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-03-04 17:04:29,067 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-03-04 17:04:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:29,068 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-03-04 17:04:29,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 17:04:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-03-04 17:04:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-03-04 17:04:29,069 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:29,069 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-03-04 17:04:29,070 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-03-04 17:04:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:29,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:33,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:33,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:33,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:33,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:33,472 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-03-04 17:04:33,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:04:33,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:04:34,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-03-04 17:04:34,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:34,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 17:04:34,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:34,179 INFO L453 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-03-04 17:04:34,179 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:34,195 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:34,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:39,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:43,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:43,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-03-04 17:04:43,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:43,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 17:04:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 17:04:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 17:04:43,686 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-03-04 17:04:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:44,497 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-03-04 17:04:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 17:04:44,497 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-03-04 17:04:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:44,498 INFO L225 Difference]: With dead ends: 403 [2019-03-04 17:04:44,498 INFO L226 Difference]: Without dead ends: 402 [2019-03-04 17:04:44,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 17:04:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-03-04 17:04:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-03-04 17:04:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-03-04 17:04:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-03-04 17:04:44,505 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-03-04 17:04:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:44,505 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-03-04 17:04:44,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 17:04:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-03-04 17:04:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-03-04 17:04:44,507 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:44,508 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-03-04 17:04:44,508 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-03-04 17:04:44,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:44,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:44,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:48,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:48,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:48,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:48,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:48,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:48,945 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-03-04 17:04:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:04:48,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:04:49,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:04:49,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:49,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 307 conjunts are in the unsatisfiable core [2019-03-04 17:04:49,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:49,140 INFO L453 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-03-04 17:04:49,140 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:49,144 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:49,144 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:54,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:58,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-03-04 17:04:58,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:58,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 17:04:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 17:04:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 17:04:58,593 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-03-04 17:04:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:59,425 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-03-04 17:04:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 17:04:59,426 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-03-04 17:04:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:59,428 INFO L225 Difference]: With dead ends: 407 [2019-03-04 17:04:59,428 INFO L226 Difference]: Without dead ends: 406 [2019-03-04 17:04:59,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 17:04:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-03-04 17:04:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-03-04 17:04:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-03-04 17:04:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-03-04 17:04:59,434 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-03-04 17:04:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:59,435 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-03-04 17:04:59,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 17:04:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-03-04 17:04:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-03-04 17:04:59,437 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:59,437 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-03-04 17:04:59,437 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-03-04 17:04:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:59,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:59,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:04,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:04,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:05:04,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:05:04,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:05:04,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:04,033 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-03-04 17:05:04,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:05:04,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:05:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 17:05:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:05:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:04,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:05:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:05:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-03-04 17:05:08,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:05:08,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-03-04 17:05:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-03-04 17:05:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-03-04 17:05:08,602 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-03-04 17:05:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:10,012 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-03-04 17:05:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-03-04 17:05:10,012 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-03-04 17:05:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:10,013 INFO L225 Difference]: With dead ends: 408 [2019-03-04 17:05:10,013 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 17:05:10,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 17:05:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 17:05:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 17:05:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 17:05:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 17:05:10,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-03-04 17:05:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:10,017 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 17:05:10,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-03-04 17:05:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 17:05:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 17:05:10,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 17:05:13,000 WARN L181 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-03-04 17:05:13,007 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-03-04 17:05:13,007 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-03-04 17:05:13,007 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-03-04 17:05:13,007 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-03-04 17:05:13,007 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-03-04 17:05:13,010 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 main_p.offset) (<= main_q.offset 0) .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_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-03-04 17:05:13,010 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-03-04 17:05:13,010 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-03-04 17:05:13,050 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 05:05:13 BoogieIcfgContainer [2019-03-04 17:05:13,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 17:05:13,050 INFO L168 Benchmark]: Toolchain (without parser) took 730065.13 ms. Allocated memory was 141.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 108.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-03-04 17:05:13,051 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 17:05:13,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.64 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 106.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 17:05:13,051 INFO L168 Benchmark]: Boogie Preprocessor took 35.14 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 17:05:13,052 INFO L168 Benchmark]: RCFGBuilder took 354.52 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 94.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-03-04 17:05:13,052 INFO L168 Benchmark]: TraceAbstraction took 729599.90 ms. Allocated memory was 141.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 94.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-03-04 17:05:13,054 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.64 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 106.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.14 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.52 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 94.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 729599.90 ms. Allocated memory was 141.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 94.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 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 == p!offset && q!offset <= 0) && 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])) || ((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, 729.4s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 44.9s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 611.6s 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, 10.4s 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.0s SsaConstructionTime, 14.0s SatisfiabilityAnalysisTime, 644.5s 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...