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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:49,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:49,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:49,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:49,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:49,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:49,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:49,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:49,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:49,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:49,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:49,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:49,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:49,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:49,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:49,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:49,658 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:49,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:49,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:49,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:49,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:49,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:49,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:49,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:49,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:49,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:49,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:49,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:49,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:49,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:49,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:49,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:49,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:49,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:49,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:49,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:49,677 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:49,691 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:49,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:49,693 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:49,693 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:49,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:49,694 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:49,694 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:49,694 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:49,694 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:49,694 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:49,695 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:49,695 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:49,695 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:49,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:49,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:49,697 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:49,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:49,697 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:49,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:49,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:49,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:49,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:49,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:49,700 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:49,700 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:49,700 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:49,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:49,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:49,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:49,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:49,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:49,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:49,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:49,704 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:49,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:49,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:49,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:49,758 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:49,759 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:49,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-03-04 16:38:49,760 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-03-04 16:38:49,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:49,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:49,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:49,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:49,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:49,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:49,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:49,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:49,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:49,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/1) ... [2019-03-04 16:38:49,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:49,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:49,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:49,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:49,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (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:38:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:50,343 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:50,344 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-03-04 16:38:50,346 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:50 BoogieIcfgContainer [2019-03-04 16:38:50,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:50,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:50,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:50,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:50,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:49" (1/2) ... [2019-03-04 16:38:50,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a590d50 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:50, skipping insertion in model container [2019-03-04 16:38:50,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:50" (2/2) ... [2019-03-04 16:38:50,357 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-03-04 16:38:50,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:50,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-03-04 16:38:50,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-03-04 16:38:50,454 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:50,454 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:50,454 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:50,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:50,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:50,455 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:50,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:50,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-03-04 16:38:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:38:50,482 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:50,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:38:50,485 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:50,491 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-03-04 16:38:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:50,687 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:38:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:50,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:50,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:50,706 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-03-04 16:38:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:50,886 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-03-04 16:38:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:50,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:38:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:50,903 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:38:50,903 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:50,907 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:38:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-03-04 16:38:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:38:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-03-04 16:38:50,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-03-04 16:38:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:50,949 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-03-04 16:38:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-03-04 16:38:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:50,950 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:50,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:50,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-03-04 16:38:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:51,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:51,122 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-03-04 16:38:51,197 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:51,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:51,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:51,275 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:51,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:51,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,281 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:38:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:51,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:51,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:51,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:38:51,489 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,500 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,611 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,776 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:38:51,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:51,849 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:38:51,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:51,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:51,957 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,050 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,111 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,130 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,142 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:52,172 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:38:52,307 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:52,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:52,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:38:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:52,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:52,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:52,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:52,469 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-03-04 16:38:52,831 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:38:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:53,041 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-03-04 16:38:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:53,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:53,043 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:53,044 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:38:53,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:38:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-03-04 16:38:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:38:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-03-04 16:38:53,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-03-04 16:38:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:53,107 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-03-04 16:38:53,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-03-04 16:38:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:53,108 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:53,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:53,109 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-03-04 16:38:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:53,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:53,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:53,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:53,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:53,203 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-03-04 16:38:53,205 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:53,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:53,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:53,211 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:53,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:53,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,212 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:38:53,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:53,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:53,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:53,292 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:38:53,292 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,297 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,305 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,321 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:38:53,360 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:53,365 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:38:53,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:53,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:53,429 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,445 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,458 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,479 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,494 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,548 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:53,549 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:38:55,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:38:55,668 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:38:55,854 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-03-04 16:38:55,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-03-04 16:38:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:56,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:38:56,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:56,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:56,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:56,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:38:56,003 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-03-04 16:38:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:56,077 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-03-04 16:38:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:56,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:38:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:56,080 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:38:56,080 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:38:56,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:38:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:38:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-03-04 16:38:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-03-04 16:38:56,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-03-04 16:38:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:56,086 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-03-04 16:38:56,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-03-04 16:38:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:56,086 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:56,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:56,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-03-04 16:38:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,114 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:38:56,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:56,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:56,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:56,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:56,116 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-03-04 16:38:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:56,164 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-03-04 16:38:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:56,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:56,166 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:56,166 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:56,166 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:38:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-03-04 16:38:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-03-04 16:38:56,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-03-04 16:38:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:56,171 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-03-04 16:38:56,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-03-04 16:38:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:56,172 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:56,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:56,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-03-04 16:38:56,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:56,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:56,242 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-03-04 16:38:56,247 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:56,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:56,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:56,252 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:56,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:56,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:56,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:56,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:38:56,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:56,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:38:56,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:56,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:56,512 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,523 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,534 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,547 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,559 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:38:56,618 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,622 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,630 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,640 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:56,694 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:38:56,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:56,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,769 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:56,770 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:38:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:56,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:56,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:56,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:56,814 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-03-04 16:38:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:56,964 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-03-04 16:38:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:56,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:56,968 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:56,969 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:38:56,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:38:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-03-04 16:38:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:38:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-03-04 16:38:56,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-03-04 16:38:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:56,974 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-03-04 16:38:56,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-03-04 16:38:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:56,975 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:56,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:56,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-03-04 16:38:56,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,042 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:38:57,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:57,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:57,043 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-03-04 16:38:57,045 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:57,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:57,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:57,051 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:57,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,052 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:38:57,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:38:57,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:57,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:38:57,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,083 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:57,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:38:57,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,262 INFO L301 Elim1Store]: Index analysis took 137 ms [2019-03-04 16:38:57,264 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:57,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,436 INFO L301 Elim1Store]: Index analysis took 148 ms [2019-03-04 16:38:57,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:57,530 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,541 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,553 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,563 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,577 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:38:57,653 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,658 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,665 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,676 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,698 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:57,699 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:38:57,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:38:57,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:38:57,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:38:57,777 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:76 [2019-03-04 16:38:57,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:38:57,877 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:38:58,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:38:58,153 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-03-04 16:38:58,346 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-03-04 16:39:02,590 WARN L181 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-03-04 16:39:02,592 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:39:02,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:02,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:02,650 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-03-04 16:39:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:11,293 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-03-04 16:39:11,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:11,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:11,296 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:39:11,296 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:11,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-03-04 16:39:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:39:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-03-04 16:39:11,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-03-04 16:39:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:11,305 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-03-04 16:39:11,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-03-04 16:39:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:11,306 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:11,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:11,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-03-04 16:39:11,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:11,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:11,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:11,344 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-03-04 16:39:11,347 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:11,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:11,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:11,353 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:11,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,353 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:39:11,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:11,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:11,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:11,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:11,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:11,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:11,475 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,484 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,494 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,506 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,517 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:11,547 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,555 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,563 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,581 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,581 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:11,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:11,665 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:31 [2019-03-04 16:39:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:11,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:39:11,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:11,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:11,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:11,850 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-03-04 16:39:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:11,977 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-03-04 16:39:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:11,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:39:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:11,978 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:39:11,978 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:39:11,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:39:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-03-04 16:39:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:39:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-03-04 16:39:11,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-03-04 16:39:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:11,985 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-03-04 16:39:11,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-03-04 16:39:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:11,986 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:11,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:11,987 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-03-04 16:39:11,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,099 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:39:12,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:12,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:12,100 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-03-04 16:39:12,102 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:12,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:12,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:12,107 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:12,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,108 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:39:12,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:12,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:12,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:12,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:12,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:12,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:12,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,269 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:12,270 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,280 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,291 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,302 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,313 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:12,348 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,353 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,363 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,373 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,395 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,396 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:12,436 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:12,436 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,452 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,453 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:12,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:39:12,492 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,505 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,505 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-03-04 16:39:12,521 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:39:12,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,546 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:39:12,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:12,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:12,567 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-03-04 16:39:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:13,067 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-03-04 16:39:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:13,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:13,068 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:39:13,068 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:13,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-03-04 16:39:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:39:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-03-04 16:39:13,076 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-03-04 16:39:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:13,077 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-03-04 16:39:13,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-03-04 16:39:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:13,077 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:13,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:13,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-03-04 16:39:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,153 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:39:13,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:13,154 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:13,154 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-03-04 16:39:13,155 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:13,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:13,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:13,159 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:13,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,160 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:39:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:13,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:13,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:13,271 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,344 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,372 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:13,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:13,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:13,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:13,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:13,443 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,451 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,461 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,471 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,480 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,502 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,502 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:13,541 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:13,542 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,557 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:13,605 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:13,606 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:13,647 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:39:13,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:13,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:13,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:13,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:13,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:13,703 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-03-04 16:39:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,102 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-03-04 16:39:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:14,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,104 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:39:14,104 INFO L226 Difference]: Without dead ends: 48 [2019-03-04 16:39:14,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-03-04 16:39:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-03-04 16:39:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:39:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-03-04 16:39:14,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-03-04 16:39:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,114 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-03-04 16:39:14,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-03-04 16:39:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:14,114 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:14,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-03-04 16:39:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:14,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:14,225 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-03-04 16:39:14,226 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:14,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:14,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:14,231 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,232 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:39:14,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:14,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:14,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:14,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:14,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:14,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:14,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:14,335 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,344 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,355 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,365 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,376 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:14,415 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,420 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,429 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,445 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,474 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:14,475 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:14,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:14,505 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,529 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:14,529 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:14,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:14,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:14,587 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-03-04 16:39:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,783 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-03-04 16:39:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:14,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:39:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,785 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:39:14,785 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:39:14,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:39:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:39:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-03-04 16:39:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:39:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-03-04 16:39:14,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-03-04 16:39:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,795 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-03-04 16:39:14,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-03-04 16:39:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:14,796 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:14,796 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-03-04 16:39:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,946 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:39:14,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:14,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:14,947 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-03-04 16:39:14,948 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:14,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:14,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:14,952 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:14,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,953 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:39:14,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:39:14,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:14,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:14,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,991 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:14,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:15,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:15,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:15,037 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,048 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,060 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,070 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,111 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:15,157 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,163 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,170 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,181 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,219 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,250 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:15,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:15,287 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:15,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:15,353 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,374 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:39:15,392 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:39:15,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:15,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:15,436 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-03-04 16:39:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:15,812 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-03-04 16:39:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:15,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:15,814 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:39:15,814 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:39:15,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:39:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-03-04 16:39:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-03-04 16:39:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-03-04 16:39:15,824 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-03-04 16:39:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:15,824 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-03-04 16:39:15,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-03-04 16:39:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:15,825 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:15,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:15,825 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-03-04 16:39:15,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,905 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:39:15,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:15,906 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:15,906 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-03-04 16:39:15,907 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:15,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:15,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:15,910 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:15,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,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 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:39:15,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:15,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:15,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:15,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:15,957 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,962 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,970 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,981 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:16,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:16,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:16,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:16,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:16,053 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,063 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,080 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,089 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,099 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,120 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,121 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:16,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:16,156 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,175 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,175 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:39:16,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:39:16,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,275 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,276 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:39:16,296 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:39:16,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:16,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:16,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:16,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:16,329 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-03-04 16:39:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:16,629 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-03-04 16:39:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:16,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:16,631 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:39:16,631 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:39:16,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:39:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-03-04 16:39:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:39:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-03-04 16:39:16,642 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-03-04 16:39:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:16,643 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-03-04 16:39:16,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-03-04 16:39:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:16,643 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:16,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:16,644 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-03-04 16:39:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:16,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:16,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:39:16,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:16,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:39:16,698 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-03-04 16:39:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:16,755 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-03-04 16:39:16,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:16,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:39:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:16,756 INFO L225 Difference]: With dead ends: 41 [2019-03-04 16:39:16,756 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:39:16,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:39:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:39:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-03-04 16:39:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:39:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-03-04 16:39:16,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-03-04 16:39:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:16,767 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-03-04 16:39:16,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-03-04 16:39:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:16,768 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:16,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:16,768 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-03-04 16:39:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,844 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:39:16,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:16,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:16,845 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:39:16,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,845 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:39:16,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:16,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:16,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:39:16,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:16,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:39:16,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:16,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:16,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:16,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:16,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:16,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:16,941 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,950 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,961 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,973 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,984 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:17,065 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,073 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,085 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,098 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,117 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,147 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:17,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:17,176 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,207 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,207 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:17,244 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:17,244 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,265 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,266 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:39:17,282 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:39:17,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:17,319 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:39:17,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:17,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:17,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:17,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:17,340 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-03-04 16:39:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:17,747 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-03-04 16:39:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:17,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:17,748 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:39:17,749 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:17,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-03-04 16:39:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:39:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-03-04 16:39:17,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-03-04 16:39:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:17,760 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-03-04 16:39:17,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-03-04 16:39:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:17,761 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:17,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:17,761 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-03-04 16:39:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,821 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:39:17,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:17,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:17,822 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-03-04 16:39:17,824 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:17,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:17,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:17,826 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:17,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,827 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:39:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:17,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:17,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:17,872 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,881 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,890 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,904 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:17,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:17,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:17,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:17,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:17,975 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,985 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,996 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,007 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,022 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,047 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:18,048 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:18,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:18,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,096 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:18,097 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:18,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:18,127 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,140 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:18,141 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:18,152 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:39:18,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:18,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:18,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:18,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:18,192 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-03-04 16:39:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:18,505 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-03-04 16:39:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:18,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:18,507 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:39:18,507 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:39:18,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:39:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-03-04 16:39:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:39:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-03-04 16:39:18,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-03-04 16:39:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:18,519 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-03-04 16:39:18,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-03-04 16:39:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:18,520 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:18,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:18,520 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-03-04 16:39:18,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:18,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:18,596 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:18,597 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-03-04 16:39:18,599 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:18,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:18,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:18,604 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:18,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,604 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:39:18,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:18,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:18,681 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:18,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:18,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:18,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:18,754 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,774 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,788 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,802 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,815 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:18,915 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,923 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,939 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,965 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:18,996 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:19,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:19,026 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,068 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:19,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:19,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:19,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:19,139 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-03-04 16:39:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:19,846 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-03-04 16:39:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:19,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:39:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:19,847 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:39:19,847 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:39:19,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:39:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:39:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-03-04 16:39:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:39:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-03-04 16:39:19,864 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-03-04 16:39:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:19,865 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-03-04 16:39:19,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-03-04 16:39:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:19,865 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:19,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:19,868 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-03-04 16:39:19,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:19,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,000 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:39:20,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:20,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:20,001 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-03-04 16:39:20,002 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:20,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:20,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:20,005 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:20,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:20,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,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 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:39:20,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:20,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:39:20,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:20,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:20,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,080 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:20,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,103 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:20,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:20,119 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,130 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,140 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,150 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,161 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:20,219 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,221 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,227 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,238 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,256 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,287 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,288 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:20,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:20,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:20,947 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-03-04 16:39:21,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:21,103 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,127 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:21,128 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:39:21,147 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:39:21,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:21,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:21,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:21,193 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-03-04 16:39:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:21,546 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-03-04 16:39:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:21,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:21,548 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:39:21,548 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:39:21,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:39:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-03-04 16:39:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:39:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-03-04 16:39:21,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-03-04 16:39:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:21,559 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-03-04 16:39:21,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-03-04 16:39:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:21,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:21,560 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:39:21,561 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-03-04 16:39:21,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:21,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:21,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:21,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:39:21,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,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 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:39:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:21,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:21,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:21,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:21,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:21,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:21,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:21,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:21,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:21,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:21,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:21,769 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,780 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,792 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,814 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,824 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:21,888 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,894 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,903 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,916 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,934 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,965 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:21,965 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:22,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:22,014 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,053 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:22,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 38 treesize of output 49 [2019-03-04 16:39:22,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:52 [2019-03-04 16:39:22,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:22,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,235 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:22,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:39:22,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:22,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:22,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:22,290 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-03-04 16:39:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:22,605 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-03-04 16:39:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:22,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:39:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:22,607 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:39:22,607 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:39:22,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:39:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-03-04 16:39:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:39:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-03-04 16:39:22,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-03-04 16:39:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:22,621 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-03-04 16:39:22,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-03-04 16:39:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:22,622 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:22,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:22,623 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-03-04 16:39:22,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,742 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:39:22,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:22,743 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-03-04 16:39:22,744 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:22,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:22,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:22,754 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:22,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:22,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:22,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:22,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,884 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:22,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:22,926 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,936 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,948 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,956 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,968 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,108 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:23,109 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,209 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,332 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,565 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:23,923 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:24,177 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-03-04 16:39:24,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:24,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,270 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:24,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:39:24,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:24,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,384 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:24,384 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-03-04 16:39:24,404 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:39:24,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:24,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:24,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:24,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:24,440 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-03-04 16:39:24,904 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-03-04 16:39:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:25,110 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-03-04 16:39:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:25,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:25,112 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:39:25,113 INFO L226 Difference]: Without dead ends: 78 [2019-03-04 16:39:25,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-03-04 16:39:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-03-04 16:39:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:39:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-03-04 16:39:25,131 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-03-04 16:39:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:25,131 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-03-04 16:39:25,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-03-04 16:39:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:25,132 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:25,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:25,133 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-03-04 16:39:25,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:25,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:25,285 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-03-04 16:39:25,286 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:25,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:25,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:25,290 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:25,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,291 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:39:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,318 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:25,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:25,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:25,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:25,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:25,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:25,468 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,477 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,488 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,499 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,510 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:25,551 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,553 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,558 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,569 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,590 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:25,590 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:25,627 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:25,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:25,713 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:25,715 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:76 [2019-03-04 16:39:25,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:39:25,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:39:25,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:39:25,961 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,052 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:39:26,053 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-03-04 16:39:26,306 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-03-04 16:39:26,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:39:26,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:39:26,420 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:39:26,680 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:39:26,779 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,843 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:39:26,844 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:129 [2019-03-04 16:39:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:27,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:27,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:27,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:27,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:27,009 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-03-04 16:39:27,279 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-03-04 16:39:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:27,912 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-03-04 16:39:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:39:27,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:27,913 INFO L225 Difference]: With dead ends: 109 [2019-03-04 16:39:27,913 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:39:27,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:39:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-03-04 16:39:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:39:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-03-04 16:39:27,929 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-03-04 16:39:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:27,929 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-03-04 16:39:27,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-03-04 16:39:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:27,930 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:27,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:27,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-03-04 16:39:27,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:27,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:28,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:28,049 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:28,049 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-03-04 16:39:28,050 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:28,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:28,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:28,055 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:28,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,056 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:39:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:28,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:28,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:28,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:28,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:28,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:28,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:28,158 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,168 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,177 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,186 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,197 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:28,229 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,231 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,237 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,247 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,268 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,268 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:28,307 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:28,307 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,324 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:28,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:28,353 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:28,382 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:39:28,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:28,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:28,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:28,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:28,424 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-03-04 16:39:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:28,757 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-03-04 16:39:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:28,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:28,758 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:39:28,759 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:39:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:39:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-03-04 16:39:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:39:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-03-04 16:39:28,778 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-03-04 16:39:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:28,778 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-03-04 16:39:28,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-03-04 16:39:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:28,779 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:28,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:28,779 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:28,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-03-04 16:39:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:28,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:28,904 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:39:28,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:28,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:28,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:28,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:28,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:28,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:28,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:28,974 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,983 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,000 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,018 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,041 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:29,080 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:29,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:29,089 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:29,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:29,096 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,109 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,124 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,136 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,148 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,186 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:29,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:29,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,275 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:29,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:29,322 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-03-04 16:39:29,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:39:29,397 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,416 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:39:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:29,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:29,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:29,521 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-03-04 16:39:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:30,018 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-03-04 16:39:30,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:30,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:30,022 INFO L225 Difference]: With dead ends: 88 [2019-03-04 16:39:30,023 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:39:30,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:39:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-03-04 16:39:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:39:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-03-04 16:39:30,040 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-03-04 16:39:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:30,040 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-03-04 16:39:30,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-03-04 16:39:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:30,041 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:30,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:30,041 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-03-04 16:39:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:30,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,385 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:39:30,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:30,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:30,385 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-03-04 16:39:30,386 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:30,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:30,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:30,390 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:30,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,390 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:39:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:30,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:30,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:30,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:30,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:30,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,567 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:30,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:30,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:30,618 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,626 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,637 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,648 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,657 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:30,684 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,689 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,697 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,717 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:30,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:30,772 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,780 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:39:30,806 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:30,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-03-04 16:39:30,831 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:39:30,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:30,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:30,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:30,901 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-03-04 16:39:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:31,155 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-03-04 16:39:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:31,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:31,157 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:39:31,157 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:39:31,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:39:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-03-04 16:39:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:39:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-03-04 16:39:31,174 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-03-04 16:39:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:31,174 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-03-04 16:39:31,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-03-04 16:39:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:31,175 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:31,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:31,175 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-03-04 16:39:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,835 WARN L181 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-03-04 16:39:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:31,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:31,890 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-03-04 16:39:31,892 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:31,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:31,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:31,895 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:31,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,896 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:39:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:31,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:31,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:31,940 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,949 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,959 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,970 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:31,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:32,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:32,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:32,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:32,555 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,699 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,792 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,801 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,810 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,832 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:32,878 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:32,878 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:32,928 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:32,929 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:32,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:39:32,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,997 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:39:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:33,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:33,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:33,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:33,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:33,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:33,086 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-03-04 16:39:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:33,536 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-03-04 16:39:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:33,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:33,538 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:39:33,538 INFO L226 Difference]: Without dead ends: 112 [2019-03-04 16:39:33,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-03-04 16:39:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-03-04 16:39:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-03-04 16:39:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-03-04 16:39:33,559 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-03-04 16:39:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:33,559 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-03-04 16:39:33,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-03-04 16:39:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:33,559 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:33,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:33,560 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-03-04 16:39:33,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:33,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:33,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:33,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:33,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:33,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:33,646 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-03-04 16:39:33,649 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:33,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:33,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:33,653 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:33,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:33,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:33,653 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:39:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:33,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:33,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:33,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:33,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:33,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,786 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:33,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:33,942 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:39:33,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:33,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,112 INFO L301 Elim1Store]: Index analysis took 146 ms [2019-03-04 16:39:34,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:34,168 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,178 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,189 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,197 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,208 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,244 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:34,245 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,248 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,255 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,267 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,290 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:34,290 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:34,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:39:34,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:39:34,455 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:39:34,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:39:34,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:39:34,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:39:34,690 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:39:34,762 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:39:34,807 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:100 [2019-03-04 16:39:34,948 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:39:34,949 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:39:35,028 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,081 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:39:35,082 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,126 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:39:35,126 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-03-04 16:39:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:35,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:39:35,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:35,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:35,213 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-03-04 16:39:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:36,046 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-03-04 16:39:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:39:36,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:36,049 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:39:36,049 INFO L226 Difference]: Without dead ends: 136 [2019-03-04 16:39:36,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-03-04 16:39:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-03-04 16:39:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:39:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-03-04 16:39:36,078 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-03-04 16:39:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:36,078 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-03-04 16:39:36,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-03-04 16:39:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:36,079 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:36,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:36,079 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-03-04 16:39:36,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:36,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:36,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:36,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:36,179 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-03-04 16:39:36,179 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:36,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:36,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:36,182 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:36,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:36,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:36,183 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:39:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:36,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:36,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:39:36,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:36,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:36,270 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,276 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,283 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,293 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,312 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:36,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:36,346 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:36,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:36,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:36,352 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,363 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,373 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,383 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,394 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,424 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,425 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:36,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:36,449 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,507 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:36,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:36,545 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,566 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,567 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:39:36,587 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:39:36,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:36,612 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:39:36,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:36,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:36,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:36,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:36,632 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-03-04 16:39:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:37,034 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-03-04 16:39:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:37,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:37,036 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:39:37,037 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:39:37,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:39:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-03-04 16:39:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:39:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-03-04 16:39:37,072 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-03-04 16:39:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:37,072 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-03-04 16:39:37,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-03-04 16:39:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:37,073 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:37,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:37,073 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-03-04 16:39:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:37,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:37,125 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-03-04 16:39:37,126 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:37,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:37,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:37,130 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,130 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:39:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:37,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:37,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:37,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:37,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,184 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:37,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:37,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:37,219 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,229 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,239 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,263 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,272 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:37,310 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,314 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,323 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,339 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,367 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:37,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:37,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,409 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:37,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:39:37,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:37,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:37,451 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-03-04 16:39:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:37,595 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-03-04 16:39:37,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:37,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:39:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:37,597 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:39:37,597 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:39:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:39:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-03-04 16:39:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:39:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-03-04 16:39:37,641 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-03-04 16:39:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:37,641 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-03-04 16:39:37,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-03-04 16:39:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:37,642 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:37,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:37,643 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-03-04 16:39:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:38,212 WARN L181 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-03-04 16:39:38,671 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:39:38,859 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:39:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:38,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:38,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:38,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:38,870 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:39:38,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:38,871 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:39:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:38,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:38,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:38,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:38,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:38,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:38,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:38,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,898 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:38,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:38,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,916 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:38,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:38,954 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,979 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,990 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,999 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,010 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,042 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:39,043 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,047 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,054 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,065 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,086 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,087 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:39,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:39:39,148 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:39:39,315 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-03-04 16:39:39,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-03-04 16:39:39,464 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-03-04 16:39:39,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:39:39,475 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:39:39,599 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:39:39,717 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:39,808 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,869 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-03-04 16:39:39,870 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:127 [2019-03-04 16:39:39,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:39:39,963 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:39:40,064 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:39:40,166 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:39:40,276 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,330 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:39:40,330 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:129 [2019-03-04 16:39:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:40,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:40,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:40,477 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-03-04 16:39:40,852 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-03-04 16:39:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:41,166 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-03-04 16:39:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:41,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:41,169 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:39:41,169 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:39:41,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:39:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-03-04 16:39:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:39:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-03-04 16:39:41,190 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-03-04 16:39:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:41,190 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-03-04 16:39:41,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-03-04 16:39:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:41,191 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:41,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:41,191 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-03-04 16:39:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,422 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-03-04 16:39:41,436 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:39:41,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:41,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:41,437 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-03-04 16:39:41,438 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:41,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:41,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:41,442 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:41,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:41,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,442 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:39:41,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:41,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:41,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:41,465 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:41,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:41,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:41,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:41,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:41,520 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,529 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,540 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,550 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,560 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:41,596 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,602 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,615 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,631 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,659 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,659 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:41,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:41,683 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:41,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:41,744 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,765 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,765 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:39:41,795 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:39:41,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:41,821 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:39:41,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:41,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:41,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:41,842 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-03-04 16:39:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:42,230 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-03-04 16:39:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:42,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:42,232 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:39:42,232 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:39:42,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:39:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-03-04 16:39:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:39:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-03-04 16:39:42,258 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-03-04 16:39:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:42,258 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-03-04 16:39:42,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-03-04 16:39:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:42,259 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:42,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:42,259 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-03-04 16:39:42,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:42,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:42,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:42,358 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-03-04 16:39:42,359 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:42,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:42,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:42,363 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:42,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:42,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:42,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:42,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:42,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:42,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:42,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:42,394 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,398 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,407 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,418 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,434 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:42,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:42,440 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:42,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:42,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:42,473 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,481 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,490 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,500 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,510 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,530 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,531 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:42,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:42,558 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,575 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-03-04 16:39:42,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:39:42,601 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:39:42,628 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:39:42,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:42,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:42,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:42,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:42,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:42,659 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-03-04 16:39:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:42,940 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-03-04 16:39:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:42,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:42,941 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:39:42,941 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:39:42,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:39:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-03-04 16:39:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:39:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-03-04 16:39:42,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-03-04 16:39:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:42,973 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-03-04 16:39:42,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-03-04 16:39:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:42,974 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:42,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:42,974 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-03-04 16:39:42,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:42,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,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:39:43,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:43,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:43,055 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-03-04 16:39:43,057 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:43,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:43,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:43,061 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:43,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,062 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:39:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:43,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:43,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:43,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:43,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,089 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:43,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:43,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:43,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:43,162 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,170 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,181 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,192 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,201 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,235 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:43,235 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,241 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,250 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,260 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,281 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,281 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:43,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:43,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,335 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,336 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:39:43,366 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:39:43,366 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,379 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:39:43,394 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:39:43,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:43,419 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:39:43,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:43,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-03-04 16:39:43,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:43,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:43,440 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-03-04 16:39:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:43,671 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-03-04 16:39:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:43,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:39:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:43,672 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:39:43,673 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:39:43,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:39:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-03-04 16:39:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:39:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-03-04 16:39:43,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-03-04 16:39:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:43,710 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-03-04 16:39:43,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-03-04 16:39:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:43,710 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:43,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:43,711 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-03-04 16:39:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:43,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:43,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:39:43,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:43,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:39:43,777 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-03-04 16:39:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:43,851 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-03-04 16:39:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:43,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:39:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:43,853 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:39:43,853 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:39:43,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:39:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:39:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-03-04 16:39:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:39:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-03-04 16:39:43,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-03-04 16:39:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:43,886 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-03-04 16:39:43,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-03-04 16:39:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:43,886 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:43,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:43,887 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-03-04 16:39:43,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:43,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:43,942 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-03-04 16:39:43,942 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:43,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:43,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:43,945 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:43,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,946 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:39:43,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:43,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:43,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:43,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:43,999 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,005 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,017 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:44,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:44,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:44,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:44,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:44,130 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,141 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,151 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,161 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,170 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,189 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,190 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:44,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:39:44,223 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:44,253 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:44,253 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2019-03-04 16:39:44,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:39:44,287 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-03-04 16:39:44,318 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:39:44,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:44,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:44,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:44,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:44,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:44,352 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-03-04 16:39:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:44,662 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-03-04 16:39:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:44,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:44,664 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:39:44,664 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:39:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:39:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-03-04 16:39:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:39:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-03-04 16:39:44,710 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-03-04 16:39:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:44,710 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-03-04 16:39:44,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-03-04 16:39:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:44,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:44,711 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:39:44,711 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-03-04 16:39:44,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:44,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:44,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:44,783 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-03-04 16:39:44,784 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:44,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:44,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:44,788 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:44,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,788 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:39:44,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:44,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:44,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:44,823 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,829 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,843 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:44,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:44,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:44,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:44,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:44,931 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,939 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,948 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,958 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,968 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,987 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,987 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:45,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:45,045 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,178 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:39:45,205 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 29 [2019-03-04 16:39:45,206 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,213 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,213 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:39:45,228 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:39:45,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:45,263 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:39:45,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:45,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:45,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:45,283 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-03-04 16:39:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:45,670 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-03-04 16:39:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:45,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:45,672 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:39:45,672 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:39:45,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:39:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-03-04 16:39:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:39:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-03-04 16:39:45,731 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-03-04 16:39:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:45,731 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-03-04 16:39:45,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-03-04 16:39:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:45,731 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:45,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:45,732 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-03-04 16:39:45,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:45,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:45,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:45,796 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-03-04 16:39:45,797 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:45,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:45,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:45,800 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:45,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,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 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:39:45,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:45,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:45,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:45,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:45,846 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,849 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,857 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,872 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,890 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,916 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:45,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:45,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:45,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:45,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:45,928 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,938 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,948 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,956 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,966 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,996 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:46,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:46,030 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:46,058 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:46,059 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:46,099 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:46,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:46,119 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:46,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:46,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:39:46,171 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:46,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:46,191 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:39:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:46,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:46,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:46,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:46,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:46,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:46,267 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-03-04 16:39:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:46,942 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-03-04 16:39:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:46,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:46,943 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:39:46,944 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:39:46,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:39:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-03-04 16:39:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:39:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-03-04 16:39:47,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-03-04 16:39:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:47,021 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-03-04 16:39:47,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-03-04 16:39:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:47,022 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:47,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:47,022 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-03-04 16:39:47,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:47,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:47,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:47,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:47,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:47,146 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-03-04 16:39:47,148 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:47,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:47,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:47,151 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:47,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:47,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:47,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 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:39:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:47,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:47,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:39:47,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:47,213 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:47,214 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,224 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,242 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,262 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:47,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:47,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:47,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:47,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:47,426 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,459 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,470 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,479 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,489 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,517 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,517 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:47,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:47,563 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,580 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:47,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:47,612 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:47,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:39:47,667 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,678 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:39:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:47,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:47,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:47,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:47,852 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-03-04 16:39:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:48,325 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-03-04 16:39:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:48,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:48,327 INFO L225 Difference]: With dead ends: 104 [2019-03-04 16:39:48,327 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:39:48,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:39:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-03-04 16:39:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:39:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-03-04 16:39:48,420 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-03-04 16:39:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:48,420 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-03-04 16:39:48,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-03-04 16:39:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:48,421 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:48,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:48,421 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-03-04 16:39:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:48,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:48,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:48,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:48,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:48,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:48,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:48,543 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-03-04 16:39:48,546 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:48,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:48,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:48,549 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:48,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:48,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,550 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:39:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:48,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:48,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:48,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:48,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:48,590 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,595 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,602 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,611 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:48,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:48,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:48,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:48,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:48,684 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,694 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,704 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,714 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,723 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,745 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:48,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:48,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:39:48,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:39:48,847 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,860 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,860 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:39:48,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:39:48,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,915 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:39:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,937 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:48,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:48,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:48,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:48,990 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-03-04 16:39:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:49,583 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-03-04 16:39:49,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:49,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:49,585 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:39:49,585 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:39:49,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:39:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-03-04 16:39:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:39:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-03-04 16:39:49,684 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-03-04 16:39:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:49,685 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-03-04 16:39:49,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-03-04 16:39:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:49,685 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:49,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:49,686 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-03-04 16:39:49,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:49,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:49,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:49,771 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:39:49,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:49,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:49,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:49,771 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-03-04 16:39:49,773 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:49,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:49,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:49,776 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:49,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:49,777 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:39:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:49,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:49,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:49,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:49,800 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:49,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:49,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:49,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:49,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:49,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:49,852 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,865 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,874 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,884 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,896 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:49,934 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,939 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,950 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,966 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:49,995 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:50,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:50,029 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,047 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:50,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:39:50,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:39:50,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,091 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:50,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:39:50,110 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:39:50,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:50,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:50,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:50,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:50,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:50,153 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-03-04 16:39:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:50,536 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-03-04 16:39:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:50,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:50,538 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:39:50,538 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:39:50,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:39:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-03-04 16:39:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-03-04 16:39:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-03-04 16:39:50,637 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-03-04 16:39:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:50,637 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-03-04 16:39:50,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-03-04 16:39:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:50,637 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:50,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:50,638 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-03-04 16:39:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:50,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:50,928 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:39:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:50,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:50,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:50,945 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-03-04 16:39:50,946 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:50,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:50,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:50,949 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:50,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:50,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,950 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:39:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:50,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:50,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:51,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:51,001 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,005 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,015 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,029 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:51,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:51,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:51,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:51,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:51,087 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,097 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,107 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,117 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,127 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,149 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:51,149 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:39:51,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:39:51,205 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:39:51,303 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:39:51,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:39:51,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2019-03-04 16:39:51,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:51,508 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:51,578 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:39:51,621 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-03-04 16:39:51,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:39:51,706 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:39:51,771 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:39:51,848 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:39:51,886 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:88 [2019-03-04 16:39:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:51,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:52,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:52,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:52,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:52,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:52,115 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-03-04 16:39:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:53,067 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-03-04 16:39:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:53,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:53,070 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:39:53,070 INFO L226 Difference]: Without dead ends: 123 [2019-03-04 16:39:53,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:39:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-03-04 16:39:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-03-04 16:39:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:39:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-03-04 16:39:53,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-03-04 16:39:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:53,177 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-03-04 16:39:53,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-03-04 16:39:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:53,178 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:53,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:53,178 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-03-04 16:39:53,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:53,315 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:39:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:53,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:53,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:53,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:53,333 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-03-04 16:39:53,334 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:53,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:53,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:53,337 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:53,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:53,338 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:39:53,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:53,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:53,365 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:53,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:53,378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:53,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,384 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:53,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:53,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:53,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:53,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:53,427 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,439 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,449 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,460 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,470 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:53,516 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,523 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,532 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,545 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,563 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,592 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:53,592 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:53,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:53,676 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,796 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:53,797 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:53,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:53,961 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:53,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:39:54,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:39:54,058 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,078 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,078 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:39:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:54,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:39:54,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:54,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:54,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:54,158 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-03-04 16:39:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:54,717 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-03-04 16:39:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:54,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:39:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:54,718 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:39:54,718 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:39:54,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:39:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-03-04 16:39:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:39:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-03-04 16:39:54,839 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-03-04 16:39:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:54,839 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-03-04 16:39:54,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-03-04 16:39:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:54,840 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:54,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:54,840 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-03-04 16:39:54,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:54,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:54,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:54,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:54,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:54,933 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:39:54,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:54,934 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:39:54,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:54,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:54,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:54,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:54,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:54,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:54,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:55,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:55,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:55,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,020 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:55,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:55,037 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,049 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,060 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,071 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,080 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:55,123 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,125 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,134 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,148 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,164 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,192 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,193 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:39:55,214 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:55,214 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,242 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,242 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:55,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:39:55,273 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,292 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,292 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:39:55,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:39:55,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,353 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:39:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:55,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:55,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:55,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:55,414 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-03-04 16:39:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:55,997 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-03-04 16:39:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:55,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:56,000 INFO L225 Difference]: With dead ends: 164 [2019-03-04 16:39:56,000 INFO L226 Difference]: Without dead ends: 163 [2019-03-04 16:39:56,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-03-04 16:39:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-03-04 16:39:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:39:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-03-04 16:39:56,318 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-03-04 16:39:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:56,318 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-03-04 16:39:56,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-03-04 16:39:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:56,319 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:56,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:56,319 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-03-04 16:39:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:56,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:56,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:56,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:56,392 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-03-04 16:39:56,393 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:56,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:56,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:56,396 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:56,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:56,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:56,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:56,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:56,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:56,453 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,459 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,468 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,485 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:56,518 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:56,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:56,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:56,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:56,538 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,546 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,555 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,565 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,575 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:56,602 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:39:56,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:56,627 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,652 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:56,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:56,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:39:56,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:56,752 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:56,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:39:56,782 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:39:56,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:56,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:56,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:56,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:56,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:56,821 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-03-04 16:39:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:57,302 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-03-04 16:39:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:57,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:57,305 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:39:57,305 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:39:57,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:39:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-03-04 16:39:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:39:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-03-04 16:39:57,539 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-03-04 16:39:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:57,539 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-03-04 16:39:57,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-03-04 16:39:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:57,540 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:57,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:57,540 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-03-04 16:39:57,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:57,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:57,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:57,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:57,632 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-03-04 16:39:57,633 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:57,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:57,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:57,638 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:57,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,639 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:39:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:57,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:57,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:57,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:57,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:57,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:57,736 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,745 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,756 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,766 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,777 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,804 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:57,804 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,809 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,818 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,837 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:57,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:57,867 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,877 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,877 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-03-04 16:39:57,900 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 24 [2019-03-04 16:39:57,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,908 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,908 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2019-03-04 16:39:57,920 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:39:57,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:57,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:57,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:57,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:57,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:57,957 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-03-04 16:39:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:58,477 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-03-04 16:39:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:58,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:58,480 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:39:58,480 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:39:58,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:39:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-03-04 16:39:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:39:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-03-04 16:39:58,710 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-03-04 16:39:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:58,710 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-03-04 16:39:58,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-03-04 16:39:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:58,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:58,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:58,711 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:58,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-03-04 16:39:58,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:39:58,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:58,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:39:58,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:58,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:39:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:39:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:39:58,820 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-03-04 16:39:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:59,209 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-03-04 16:39:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:59,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-03-04 16:39:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:59,211 INFO L225 Difference]: With dead ends: 185 [2019-03-04 16:39:59,211 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:39:59,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:39:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:39:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-03-04 16:39:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:39:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-03-04 16:39:59,448 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-03-04 16:39:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:59,448 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-03-04 16:39:59,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:39:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-03-04 16:39:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:59,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:59,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:59,449 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-03-04 16:39:59,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:59,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:59,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:59,523 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-03-04 16:39:59,524 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:59,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:59,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:59,527 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:59,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,528 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:39:59,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:59,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:59,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:39:59,564 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,573 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,582 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:39:59,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:59,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:39:59,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:59,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:59,670 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,683 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,694 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,709 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,722 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,745 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:39:59,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:59,791 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:39:59,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:59,858 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,870 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:59,887 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:39:59,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:59,928 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:39:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:59,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:59,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:59,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:59,946 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-03-04 16:40:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:00,473 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-03-04 16:40:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:00,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:40:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:00,476 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:40:00,476 INFO L226 Difference]: Without dead ends: 141 [2019-03-04 16:40:00,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-03-04 16:40:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-03-04 16:40:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:40:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-03-04 16:40:00,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-03-04 16:40:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-03-04 16:40:00,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-03-04 16:40:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:00,723 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:00,723 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:40:00,723 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-03-04 16:40:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:00,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:00,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:00,829 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-03-04 16:40:00,830 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:00,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:00,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:00,832 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:00,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:00,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,833 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:40:00,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:00,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,848 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:00,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:00,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:00,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:00,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:00,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:00,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:00,910 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,920 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,930 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,941 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,952 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:00,989 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,993 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,004 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,020 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:01,048 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:40:01,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:01,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:01,123 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:01,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:40:01,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:40:01,339 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,353 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:01,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-03-04 16:40:01,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 49 [2019-03-04 16:40:01,404 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:01,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:40:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:01,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:40:01,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:01,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:40:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:40:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:01,481 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-03-04 16:40:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:02,213 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-03-04 16:40:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:02,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:40:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:02,217 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:40:02,217 INFO L226 Difference]: Without dead ends: 216 [2019-03-04 16:40:02,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-03-04 16:40:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-03-04 16:40:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:40:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-03-04 16:40:02,500 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-03-04 16:40:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:02,501 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-03-04 16:40:02,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:40:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-03-04 16:40:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:02,502 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:02,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:02,502 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-03-04 16:40:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:02,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:02,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:02,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:02,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:02,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:02,579 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:40:02,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:02,579 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:40:02,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:02,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:02,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:02,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:02,593 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:02,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:02,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:02,620 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,630 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,640 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,651 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:02,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:02,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:02,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:02,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:40:02,708 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,716 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,726 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,736 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,746 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,767 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:02,767 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:40:02,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:02,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:02,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:02,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:79 [2019-03-04 16:40:02,908 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:40:02,909 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:03,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:40:03,007 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,054 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-03-04 16:40:03,054 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-03-04 16:40:03,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 42 treesize of output 65 [2019-03-04 16:40:03,158 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-03-04 16:40:03,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:40:03,300 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 41 [2019-03-04 16:40:03,411 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-03-04 16:40:03,487 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-03-04 16:40:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:03,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:03,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:03,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:03,652 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-03-04 16:40:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,766 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-03-04 16:40:04,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:04,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,770 INFO L225 Difference]: With dead ends: 218 [2019-03-04 16:40:04,771 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:40:04,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:40:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-03-04 16:40:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-03-04 16:40:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-03-04 16:40:05,105 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-03-04 16:40:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:05,106 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-03-04 16:40:05,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-03-04 16:40:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:05,106 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:05,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:05,107 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-03-04 16:40:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:05,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:05,173 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-03-04 16:40:05,173 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:05,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:05,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:05,176 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:05,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,177 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:40:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:05,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:05,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:05,220 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,226 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,240 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,258 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:05,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:05,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:05,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:05,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:05,331 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,341 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,350 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,360 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,370 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,398 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,398 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:40:05,417 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:05,417 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:40:05,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:40:05,475 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:36 [2019-03-04 16:40:05,508 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:40:05,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:05,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:05,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:05,542 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-03-04 16:40:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:06,355 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-03-04 16:40:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:06,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:40:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:06,359 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:40:06,359 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:40:06,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:40:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-03-04 16:40:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:40:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-03-04 16:40:06,853 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-03-04 16:40:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-03-04 16:40:06,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-03-04 16:40:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:06,854 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:06,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:06,854 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-03-04 16:40:06,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:06,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:06,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:06,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:06,964 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-03-04 16:40:06,965 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:06,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:06,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:06,967 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:06,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:06,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:06,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,968 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:40:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:06,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:06,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:06,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:06,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:07,005 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:07,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:07,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,030 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:07,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:07,048 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,059 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,068 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,089 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:07,125 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,131 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,142 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,158 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,185 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,185 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:40:07,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:07,211 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,236 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:40:07,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:40:07,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:07,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:07,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:40:07,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:40:07,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-03-04 16:40:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:07,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:40:07,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:07,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:07,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:07,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:07,457 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-03-04 16:40:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:08,968 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-03-04 16:40:08,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:40:08,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:08,974 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:40:08,974 INFO L226 Difference]: Without dead ends: 477 [2019-03-04 16:40:08,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-03-04 16:40:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-03-04 16:40:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-03-04 16:40:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-03-04 16:40:09,820 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-03-04 16:40:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:09,820 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-03-04 16:40:09,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-03-04 16:40:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:09,821 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:09,821 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:40:09,821 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-03-04 16:40:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:09,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:09,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:09,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:09,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:09,859 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-03-04 16:40:09,860 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:09,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:09,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:09,862 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:09,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:09,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:09,863 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:40:09,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:09,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:09,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:40:09,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:09,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:09,902 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:09,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:09,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:40:10,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:40:10,019 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,031 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,044 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,056 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,068 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,081 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:10,081 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:40:10,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:40:10,090 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:40:10,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-03-04 16:40:10,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-03-04 16:40:10,114 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:40:10,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:40:10,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-03-04 16:40:10,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:10,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:40:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:40:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:10,136 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-03-04 16:40:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:12,081 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-03-04 16:40:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:12,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:40:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:12,088 INFO L225 Difference]: With dead ends: 804 [2019-03-04 16:40:12,088 INFO L226 Difference]: Without dead ends: 800 [2019-03-04 16:40:12,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-03-04 16:40:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-03-04 16:40:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-03-04 16:40:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-03-04 16:40:14,062 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-03-04 16:40:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:14,063 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-03-04 16:40:14,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:40:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-03-04 16:40:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:14,065 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:14,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:14,066 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-03-04 16:40:14,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:14,243 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:40:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:14,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:14,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:14,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:14,348 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-03-04 16:40:14,349 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:14,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:14,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:14,352 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:14,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:14,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:14,352 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:40:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:14,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:14,365 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:40:14,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:14,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:14,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:14,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:14,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:14,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:14,409 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,420 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,432 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,443 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,456 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:14,503 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,512 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,524 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,559 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,577 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,605 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,605 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:40:14,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:14,642 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,671 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:14,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:40:14,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,734 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:40:14,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:40:14,784 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,800 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:40:14,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:40:14,868 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,885 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:40:14,913 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:40:14,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:15,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:40:15,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:15,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:15,006 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-03-04 16:40:15,506 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-03-04 16:40:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:17,726 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-03-04 16:40:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:17,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:17,733 INFO L225 Difference]: With dead ends: 821 [2019-03-04 16:40:17,733 INFO L226 Difference]: Without dead ends: 820 [2019-03-04 16:40:17,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:40:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-03-04 16:40:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-03-04 16:40:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-03-04 16:40:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-03-04 16:40:19,641 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-03-04 16:40:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:19,641 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-03-04 16:40:19,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-03-04 16:40:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:19,644 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:19,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:19,644 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-03-04 16:40:19,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:19,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:19,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:19,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:19,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:19,695 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:40:19,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:19,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:19,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:19,695 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-03-04 16:40:19,696 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:19,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:19,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:19,699 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:19,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:19,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:19,699 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:40:19,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:19,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:19,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:19,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:40:19,731 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,744 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:19,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:19,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:19,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:40:19,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:19,848 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,858 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,869 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,880 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,891 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,930 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-03-04 16:40:19,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:40:19,953 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,959 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-03-04 16:40:19,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 16:40:19,976 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,981 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-03-04 16:40:19,992 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:40:19,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:20,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:20,033 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-03-04 16:40:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:22,069 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-03-04 16:40:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:22,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:40:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:22,075 INFO L225 Difference]: With dead ends: 805 [2019-03-04 16:40:22,075 INFO L226 Difference]: Without dead ends: 804 [2019-03-04 16:40:22,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-03-04 16:40:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-03-04 16:40:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-03-04 16:40:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-03-04 16:40:24,084 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-03-04 16:40:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:24,084 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-03-04 16:40:24,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-03-04 16:40:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:24,086 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:24,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:24,086 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-03-04 16:40:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:24,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:24,208 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-03-04 16:40:24,209 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:24,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:24,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:24,212 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:24,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,213 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:40:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:24,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:24,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:24,235 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:24,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:24,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,267 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:24,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:24,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:24,297 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,307 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,318 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,328 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,339 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:24,375 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,381 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,390 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,406 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,432 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:40:24,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:24,476 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:40:24,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:40:24,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,538 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:40:24,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:40:24,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,593 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:40:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:24,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:24,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:24,682 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-03-04 16:40:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:27,470 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-03-04 16:40:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:27,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:27,480 INFO L225 Difference]: With dead ends: 1004 [2019-03-04 16:40:27,480 INFO L226 Difference]: Without dead ends: 1003 [2019-03-04 16:40:27,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-03-04 16:40:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-03-04 16:40:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-03-04 16:40:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-03-04 16:40:29,696 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-03-04 16:40:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:29,696 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-03-04 16:40:29,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-03-04 16:40:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:29,698 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:29,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:29,699 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-03-04 16:40:29,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,791 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:40:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:29,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:29,792 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-03-04 16:40:29,793 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:29,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:29,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:29,796 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:29,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,797 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:40:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:29,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:29,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:29,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:40:29,838 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,845 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,857 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:29,882 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:29,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:29,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:29,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:40:29,926 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,935 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,945 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,954 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,964 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,983 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:40:30,035 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:30,035 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:30,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:31 [2019-03-04 16:40:30,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:40:30,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:30,240 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:30,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:50 [2019-03-04 16:40:30,267 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:40:30,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:30,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:30,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:40:30,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:30,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:40:30,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:40:30,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:30,301 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-03-04 16:40:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:33,543 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-03-04 16:40:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:33,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:40:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:33,552 INFO L225 Difference]: With dead ends: 1213 [2019-03-04 16:40:33,552 INFO L226 Difference]: Without dead ends: 1212 [2019-03-04 16:40:33,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-03-04 16:40:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-03-04 16:40:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-03-04 16:40:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-03-04 16:40:36,436 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-03-04 16:40:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:36,437 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-03-04 16:40:36,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:40:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-03-04 16:40:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:36,439 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:36,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:36,439 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:36,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-03-04 16:40:36,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:36,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:36,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:36,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:36,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:36,579 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-03-04 16:40:36,580 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:36,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:36,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:36,583 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:36,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:36,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,584 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:40:36,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:36,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:36,598 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:40:36,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:36,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:36,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:36,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:36,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,633 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:36,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:36,650 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,662 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,673 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,684 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,695 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:36,736 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,741 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,749 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,763 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,780 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,810 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,810 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:40:36,852 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:36,853 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,881 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:36,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:36,921 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,943 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,943 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-03-04 16:40:36,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:40:36,996 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,013 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-03-04 16:40:37,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:40:37,074 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,090 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:37,113 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:40:37,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:37,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:37,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:37,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:37,178 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-03-04 16:40:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,512 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-03-04 16:40:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:40:41,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,527 INFO L225 Difference]: With dead ends: 1577 [2019-03-04 16:40:41,527 INFO L226 Difference]: Without dead ends: 1575 [2019-03-04 16:40:41,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-03-04 16:40:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-03-04 16:40:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-03-04 16:40:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-03-04 16:40:43,548 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-03-04 16:40:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:43,548 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-03-04 16:40:43,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-03-04 16:40:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:43,549 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:43,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:43,549 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-03-04 16:40:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,701 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:40:43,968 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-03-04 16:40:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:44,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:44,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:44,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:44,026 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-03-04 16:40:44,026 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:44,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:44,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:44,029 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:44,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:44,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:44,030 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:40:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:44,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:44,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:40:44,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:44,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:44,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:44,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:44,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,076 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:44,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:44,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:40:44,116 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,125 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,134 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,145 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,156 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:44,187 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,193 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,200 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,210 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,231 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,231 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:40:44,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:44,274 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,290 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,291 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:40:44,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:40:44,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,337 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,338 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-03-04 16:40:44,380 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:40:44,381 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,392 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:40:44,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-03-04 16:40:44,466 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:44,477 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:44,477 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:40:44,497 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:40:44,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:44,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:44,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:40:44,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:44,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:44,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:44,565 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-03-04 16:40:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:47,944 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-03-04 16:40:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:47,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:40:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:47,950 INFO L225 Difference]: With dead ends: 1108 [2019-03-04 16:40:47,950 INFO L226 Difference]: Without dead ends: 1107 [2019-03-04 16:40:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-03-04 16:40:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-03-04 16:40:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-03-04 16:40:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-03-04 16:40:50,811 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-03-04 16:40:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:50,811 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-03-04 16:40:50,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-03-04 16:40:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:50,814 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:50,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:50,814 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-03-04 16:40:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:50,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:50,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:50,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:50,927 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-03-04 16:40:50,927 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:50,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:50,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:50,931 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:50,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:50,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,931 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:40:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:50,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:50,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:50,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:50,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:50,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:50,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,978 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:50,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:51,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:51,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:51,053 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,063 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,075 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,091 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,109 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:51,161 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,167 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,180 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,200 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,233 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:51,234 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:40:51,264 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:51,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,289 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:51,290 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:40:51,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:40:51,331 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:51,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:51,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:40:51,445 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:40:51,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:51,468 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:40:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:51,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:51,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:51,488 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-03-04 16:40:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:54,499 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-03-04 16:40:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:54,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:40:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:54,504 INFO L225 Difference]: With dead ends: 1075 [2019-03-04 16:40:54,504 INFO L226 Difference]: Without dead ends: 1074 [2019-03-04 16:40:54,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-03-04 16:40:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-03-04 16:40:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-03-04 16:40:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-03-04 16:40:57,409 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-03-04 16:40:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:57,409 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-03-04 16:40:57,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-03-04 16:40:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:57,411 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:57,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:57,411 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-03-04 16:40:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:57,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:57,573 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:40:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:57,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:57,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:57,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:57,624 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-03-04 16:40:57,624 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:57,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:57,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:57,627 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:57,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:57,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:57,628 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:40:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:57,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:57,646 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:40:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:57,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:40:57,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:57,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:40:57,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:57,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:57,693 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,705 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,736 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,750 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,761 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:57,803 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,808 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,819 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,831 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,849 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,879 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:57,880 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:40:57,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:57,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:57,941 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:40:57,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:57,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,002 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:40:58,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:40:58,135 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,151 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2019-03-04 16:40:58,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:40:58,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,234 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,234 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:40:58,257 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:40:58,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:58,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:58,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:58,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:58,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:58,329 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-03-04 16:41:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:02,913 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-03-04 16:41:02,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:02,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:41:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:02,920 INFO L225 Difference]: With dead ends: 1522 [2019-03-04 16:41:02,921 INFO L226 Difference]: Without dead ends: 1521 [2019-03-04 16:41:02,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-03-04 16:41:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-03-04 16:41:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-03-04 16:41:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-03-04 16:41:06,086 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-03-04 16:41:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:06,086 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-03-04 16:41:06,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-03-04 16:41:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:41:06,089 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:06,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:06,089 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-03-04 16:41:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:06,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:06,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:06,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:06,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:41:06,129 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-03-04 16:41:06,130 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:06,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:06,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:06,133 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:06,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:06,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:06,134 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:41:06,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:06,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:06,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:41:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:06,190 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:41:06,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:06,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:41:06,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:41:06,333 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:41:06,333 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,345 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,357 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,370 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,394 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:06,395 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:41:06,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:41:06,402 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,404 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:41:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:41:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:41:06,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:41:06,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:41:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:41:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:41:06,458 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-03-04 16:41:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:10,464 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-03-04 16:41:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:41:10,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-03-04 16:41:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:10,473 INFO L225 Difference]: With dead ends: 1559 [2019-03-04 16:41:10,473 INFO L226 Difference]: Without dead ends: 1554 [2019-03-04 16:41:10,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:41:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-03-04 16:41:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-03-04 16:41:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-03-04 16:41:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-03-04 16:41:14,878 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-03-04 16:41:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:14,878 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-03-04 16:41:14,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:41:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-03-04 16:41:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:41:14,881 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:14,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:14,881 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-03-04 16:41:14,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:14,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:14,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:14,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:41:14,935 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-03-04 16:41:14,936 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:14,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:14,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:14,939 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:14,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,940 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:41:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:14,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:14,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:41:14,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:14,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:41:15,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:15,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:15,025 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,036 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,045 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,056 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,065 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:15,103 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,107 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,119 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,135 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,162 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:15,162 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:41:15,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:15,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,217 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:15,218 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:41:15,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:41:15,263 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:15,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:15,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:41:15,342 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:41:15,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:15,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:15,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:15,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:15,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:15,564 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-03-04 16:41:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:19,968 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-03-04 16:41:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:19,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:41:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:19,974 INFO L225 Difference]: With dead ends: 1574 [2019-03-04 16:41:19,974 INFO L226 Difference]: Without dead ends: 1570 [2019-03-04 16:41:19,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-03-04 16:41:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-03-04 16:41:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-03-04 16:41:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-03-04 16:41:24,329 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-03-04 16:41:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:24,330 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-03-04 16:41:24,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-03-04 16:41:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:41:24,332 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:24,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:41:24,333 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-03-04 16:41:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:24,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:24,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:24,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:24,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:24,402 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:41:24,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:24,402 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:41:24,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:24,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:24,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:24,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:24,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:24,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:24,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:41:24,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:24,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,450 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:41:24,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:24,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:24,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:24,478 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,489 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,499 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,579 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,588 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:24,624 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,631 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,643 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,658 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,685 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:24,685 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:41:24,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:24,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:24,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:41:24,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:41:24,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:24,822 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:24,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:76 [2019-03-04 16:41:24,882 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:41:24,883 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:24,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-03-04 16:41:24,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 34 [2019-03-04 16:41:24,936 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:24,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:24,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-03-04 16:41:24,980 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:41:24,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:25,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:25,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:41:25,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:25,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:41:25,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:41:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:25,075 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-03-04 16:41:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:31,167 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-03-04 16:41:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:31,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:41:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:31,173 INFO L225 Difference]: With dead ends: 2098 [2019-03-04 16:41:31,173 INFO L226 Difference]: Without dead ends: 2091 [2019-03-04 16:41:31,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:41:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-03-04 16:41:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-03-04 16:41:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-03-04 16:41:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-03-04 16:41:36,441 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-03-04 16:41:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:36,441 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-03-04 16:41:36,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:41:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-03-04 16:41:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:41:36,444 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:36,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:36,444 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-03-04 16:41:36,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,620 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:41:36,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:36,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:41:36,621 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-03-04 16:41:36,621 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:36,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:36,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:36,625 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:36,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,625 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:41:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:36,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:36,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:36,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:41:36,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:36,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:41:36,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:36,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:36,694 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,703 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,714 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,725 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,735 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:36,770 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,774 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,784 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,800 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,828 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:36,828 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:41:36,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:36,862 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,879 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:36,879 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:41:36,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:41:36,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,924 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:36,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:41:36,950 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:41:36,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:36,987 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:41:37,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:37,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:37,014 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-03-04 16:41:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:42,197 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-03-04 16:41:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:42,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:41:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:42,201 INFO L225 Difference]: With dead ends: 1846 [2019-03-04 16:41:42,202 INFO L226 Difference]: Without dead ends: 1839 [2019-03-04 16:41:42,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-03-04 16:41:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-03-04 16:41:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-03-04 16:41:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-03-04 16:41:47,338 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-03-04 16:41:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-03-04 16:41:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-03-04 16:41:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:41:47,341 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:47,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:47,342 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-03-04 16:41:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:47,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:47,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:47,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:47,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:47,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:41:47,559 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-03-04 16:41:47,560 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:47,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:47,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:47,563 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:47,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:47,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:47,563 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:41:47,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:47,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:47,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:47,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:47,612 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:41:47,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:47,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:41:47,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:47,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:47,669 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:47,669 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,680 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,691 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,702 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,712 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:47,746 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,752 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,761 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,777 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:47,805 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:47,806 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:41:47,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:47,847 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:47,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:47,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-03-04 16:41:47,991 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 45 [2019-03-04 16:41:47,992 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:48,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:41:48,064 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:48,098 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:48,099 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-03-04 16:41:48,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:41:48,177 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:48,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:41:48,244 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:48,279 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:48,279 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:74 [2019-03-04 16:41:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:48,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:48,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:41:48,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:41:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:41:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:48,392 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-03-04 16:41:52,490 WARN L181 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-03-04 16:41:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:57,632 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-03-04 16:41:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:57,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:41:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:57,638 INFO L225 Difference]: With dead ends: 2193 [2019-03-04 16:41:57,638 INFO L226 Difference]: Without dead ends: 2192 [2019-03-04 16:41:57,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-03-04 16:42:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-03-04 16:42:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-03-04 16:42:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-03-04 16:42:03,307 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-03-04 16:42:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:03,307 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-03-04 16:42:03,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-03-04 16:42:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:03,310 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:03,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:03,310 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:03,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-03-04 16:42:03,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:03,419 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:42:03,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:03,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:03,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:03,420 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:42:03,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:03,420 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:42:03,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:03,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:03,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:42:03,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:03,436 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:42:03,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:03,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:42:03,464 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,472 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,482 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,498 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,519 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:42:03,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:03,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:42:03,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:03,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:03,559 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,572 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,582 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,592 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,601 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,631 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:03,632 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:42:03,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:03,664 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,692 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:03,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:42:03,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:42:03,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:03,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2019-03-04 16:42:03,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:42:03,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:03,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:42:03,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:42:03,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,942 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:03,942 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:42:03,964 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:42:03,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:04,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:42:04,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:42:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:42:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:04,029 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-03-04 16:42:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:11,318 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-03-04 16:42:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:11,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:42:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:11,325 INFO L225 Difference]: With dead ends: 2526 [2019-03-04 16:42:11,325 INFO L226 Difference]: Without dead ends: 2520 [2019-03-04 16:42:11,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-03-04 16:42:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-03-04 16:42:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-03-04 16:42:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-03-04 16:42:17,123 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-03-04 16:42:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:17,123 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-03-04 16:42:17,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:42:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-03-04 16:42:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:17,127 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:17,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:17,127 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-03-04 16:42:17,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:17,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:17,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:17,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:17,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:42:17,274 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-03-04 16:42:17,275 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:17,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:17,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:17,278 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:17,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:17,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:17,279 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:42:17,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:17,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:17,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:42:17,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:17,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:42:17,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:17,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:42:17,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:17,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:17,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:17,353 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,367 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,378 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,387 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,398 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:42:17,433 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,438 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,447 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,463 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:17,492 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:42:17,527 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:17,528 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:17,569 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:42:17,569 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:42:17,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:17,608 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:17,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:17,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-03-04 16:42:17,644 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:42:17,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:17,669 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:42:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:17,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-03-04 16:42:17,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:17,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:42:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:42:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:17,690 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-03-04 16:42:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:23,278 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-03-04 16:42:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:23,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:42:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:23,284 INFO L225 Difference]: With dead ends: 1971 [2019-03-04 16:42:23,284 INFO L226 Difference]: Without dead ends: 1964 [2019-03-04 16:42:23,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-03-04 16:42:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-03-04 16:42:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-03-04 16:42:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-03-04 16:42:29,073 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-03-04 16:42:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:29,074 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-03-04 16:42:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:42:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-03-04 16:42:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:29,078 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:29,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:29,078 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-03-04 16:42:29,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:29,218 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:42:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:29,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:29,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:42:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,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 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:42:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:29,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:29,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:42:29,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:29,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:42:29,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:29,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:42:29,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:29,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:42:29,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:29,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:29,338 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,347 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,357 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,366 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,377 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:42:29,414 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,421 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,433 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,449 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,476 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,477 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:42:29,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:29,523 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,541 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:42:29,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:42:29,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,589 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,589 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:42:29,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:42:29,631 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,642 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:42:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:29,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:29,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:42:29,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:29,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:42:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:42:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:29,719 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-03-04 16:42:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:35,739 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-03-04 16:42:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:35,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:42:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:35,745 INFO L225 Difference]: With dead ends: 2036 [2019-03-04 16:42:35,745 INFO L226 Difference]: Without dead ends: 2033 [2019-03-04 16:42:35,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-03-04 16:42:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-03-04 16:42:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-03-04 16:42:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-03-04 16:42:41,757 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-03-04 16:42:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:41,757 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-03-04 16:42:41,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:42:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-03-04 16:42:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:41,760 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:41,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:41,761 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-03-04 16:42:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:41,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:41,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:41,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:41,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:41,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:41,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:41,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:41,834 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:42:41,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:41,834 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:42:41,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:41,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:41,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:41,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:41,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:42:41,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:41,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:42:41,875 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,886 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,898 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,912 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:42:41,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:41,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:42:41,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:41,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:42:41,973 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,980 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,990 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,000 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,010 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,030 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:42,031 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:42:42,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:42,068 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:42,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-03-04 16:42:42,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:79 [2019-03-04 16:42:42,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:42:42,198 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:42:42,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:42:42,362 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,450 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-03-04 16:42:42,451 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-03-04 16:42:42,569 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-03-04 16:42:42,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:42:42,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 45 [2019-03-04 16:42:42,681 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:42:42,767 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:42:42,858 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:42,909 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-03-04 16:42:42,910 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-03-04 16:42:43,020 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:42:43,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:43,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:42:43,114 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:43,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:42:43,197 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:43,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:42:43,283 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:43,333 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:42:43,334 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-03-04 16:42:47,484 WARN L181 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-03-04 16:42:47,488 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:42:47,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:47,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:47,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:42:47,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:47,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:47,630 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-03-04 16:42:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:56,973 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-03-04 16:42:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:42:56,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:42:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:56,983 INFO L225 Difference]: With dead ends: 2952 [2019-03-04 16:42:56,983 INFO L226 Difference]: Without dead ends: 2951 [2019-03-04 16:42:56,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:42:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-03-04 16:43:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-03-04 16:43:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-03-04 16:43:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-03-04 16:43:02,389 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-03-04 16:43:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:02,389 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-03-04 16:43:02,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:43:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-03-04 16:43:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:02,391 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:02,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:02,392 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-03-04 16:43:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:02,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:02,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:02,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:02,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:02,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:02,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-03-04 16:43:02,558 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:02,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:02,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:02,561 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:43:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:02,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:02,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:02,562 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:43:02,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:02,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:02,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:43:02,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:02,605 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:43:02,605 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,610 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,622 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,636 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:43:02,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:43:02,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:43:02,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:02,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:02,685 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,695 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,704 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,714 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,724 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:02,753 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:43:02,788 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:43:02,789 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:43:02,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:02,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:43:02,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:43:02,920 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:43:02,983 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:03,025 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:03,025 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:116, output treesize:86 [2019-03-04 16:43:03,090 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:43:03,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:03,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:03,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-03-04 16:43:03,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:03,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:43:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:43:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:43:03,170 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-03-04 16:43:03,505 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-03-04 16:43:03,723 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-03-04 16:43:03,874 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-03-04 16:43:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:09,673 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-03-04 16:43:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:09,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:43:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:09,678 INFO L225 Difference]: With dead ends: 1903 [2019-03-04 16:43:09,679 INFO L226 Difference]: Without dead ends: 1896 [2019-03-04 16:43:09,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-03-04 16:43:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-03-04 16:43:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-03-04 16:43:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-03-04 16:43:15,632 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-03-04 16:43:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:15,632 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-03-04 16:43:15,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:43:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-03-04 16:43:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:15,635 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:15,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:15,635 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-03-04 16:43:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:15,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:15,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:15,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:15,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:15,701 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:43:15,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43:15,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:15,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:15,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:43:15,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:15,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:43:15,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:15,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:43:15,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:43:15,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:43:15,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:15,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:15,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:15,782 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,799 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,809 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,819 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,830 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:43:15,866 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,872 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,881 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,897 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:15,923 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:43:15,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:15,966 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:16,002 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:16,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:43:16,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:43:16,046 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:43:16,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:16,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:43:16,120 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:43:16,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:16,140 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:43:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:43:16,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:16,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:43:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:43:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:43:16,159 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-03-04 16:43:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:21,866 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-03-04 16:43:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:43:21,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:43:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:21,871 INFO L225 Difference]: With dead ends: 1884 [2019-03-04 16:43:21,871 INFO L226 Difference]: Without dead ends: 1877 [2019-03-04 16:43:21,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:43:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-03-04 16:43:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-03-04 16:43:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-03-04 16:43:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-03-04 16:43:27,900 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-03-04 16:43:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:27,900 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-03-04 16:43:27,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:43:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-03-04 16:43:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:43:27,904 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:27,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:27,904 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-03-04 16:43:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:27,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:27,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:28,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:28,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:28,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:43:28,004 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-03-04 16:43:28,005 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:28,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:28,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:28,008 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:43:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:28,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:28,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:28,008 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:43:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:28,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:28,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:43:28,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:28,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:43:28,065 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,076 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,091 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,111 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:43:28,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:43:28,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:43:28,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:28,163 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:28,164 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,172 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,182 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,191 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,201 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,229 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:28,229 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:43:28,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:28,255 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,282 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:28,282 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:43:28,315 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:43:28,316 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:28,336 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:28,336 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 16:43:28,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:43:28,391 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:43:28,426 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:28,426 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:68 [2019-03-04 16:43:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:28,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:28,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:28,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:43:28,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:28,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:43:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:43:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:43:28,516 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-03-04 16:43:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:37,565 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-03-04 16:43:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:43:37,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:43:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:37,574 INFO L225 Difference]: With dead ends: 2991 [2019-03-04 16:43:37,574 INFO L226 Difference]: Without dead ends: 2978 [2019-03-04 16:43:37,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:43:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-03-04 16:43:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-03-04 16:43:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-03-04 16:43:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-03-04 16:43:45,519 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-03-04 16:43:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:45,519 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-03-04 16:43:45,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:43:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-03-04 16:43:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:43:45,523 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:45,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:45,523 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-03-04 16:43:45,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:45,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:45,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:45,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:45,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:45,624 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:43:45,624 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-03-04 16:43:45,625 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:45,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:45,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:45,628 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:43:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:45,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:45,628 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:43:45,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:45,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:45,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:43:45,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:45,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:43:45,677 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,681 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,691 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,701 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,719 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:43:45,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:45,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:43:45,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:45,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:45,800 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,929 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,937 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,947 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,957 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,986 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:45,986 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:43:46,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:46,025 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:46,053 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:46,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:43:46,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:43:46,098 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:46,119 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:46,120 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:43:46,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:43:46,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:46,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:46,191 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:43:46,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:43:46,255 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:46,270 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:46,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2019-03-04 16:43:46,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 59 [2019-03-04 16:43:46,349 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:46,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:46,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:43:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:46,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:47,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:47,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:43:47,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:47,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:43:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:43:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:43:47,061 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-03-04 16:43:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:57,392 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-03-04 16:43:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:43:57,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:43:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:57,401 INFO L225 Difference]: With dead ends: 3181 [2019-03-04 16:43:57,401 INFO L226 Difference]: Without dead ends: 3179 [2019-03-04 16:43:57,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:43:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-03-04 16:44:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-03-04 16:44:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-03-04 16:44:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-03-04 16:44:05,097 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-03-04 16:44:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:05,097 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-03-04 16:44:05,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:44:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-03-04 16:44:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:05,101 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:05,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:05,101 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-03-04 16:44:05,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:05,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:05,256 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:44:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:44:05,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:44:05,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:44:05,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:44:05,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:44:05,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:44:05,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:44:05,283 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-03-04 16:44:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:12,425 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-03-04 16:44:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:44:12,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:44:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:12,434 INFO L225 Difference]: With dead ends: 2346 [2019-03-04 16:44:12,434 INFO L226 Difference]: Without dead ends: 2337 [2019-03-04 16:44:12,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:44:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-03-04 16:44:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-03-04 16:44:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-03-04 16:44:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-03-04 16:44:20,158 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-03-04 16:44:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-03-04 16:44:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:44:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-03-04 16:44:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:20,162 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:20,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:20,162 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-03-04 16:44:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:20,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:20,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:20,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:20,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:20,304 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:44:20,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:20,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:20,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:44:20,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:44:20,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:44:20,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:20,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:44:20,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:20,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:44:20,364 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,367 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,372 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,382 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,398 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:20,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:44:20,429 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:20,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:20,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:44:20,495 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,523 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,532 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,542 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,552 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,582 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,582 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:44:20,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:44:20,619 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,647 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:20,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:44:20,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:44:20,689 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,710 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:20,711 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:44:20,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:44:20,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:20,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-03-04 16:44:20,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:44:20,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:20,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:44:20,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 59 [2019-03-04 16:44:20,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:20,964 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:20,964 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:44:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:20,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:21,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:21,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:44:21,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:21,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:44:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:44:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:44:21,102 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-03-04 16:44:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:29,232 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-03-04 16:44:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:44:29,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:44:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:29,238 INFO L225 Difference]: With dead ends: 2345 [2019-03-04 16:44:29,238 INFO L226 Difference]: Without dead ends: 2338 [2019-03-04 16:44:29,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:44:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-03-04 16:44:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-03-04 16:44:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-03-04 16:44:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-03-04 16:44:31,426 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-03-04 16:44:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:31,426 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-03-04 16:44:31,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:44:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-03-04 16:44:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:31,427 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:31,427 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:31,427 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-03-04 16:44:31,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:31,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:31,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:31,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:31,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:31,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:44:31,505 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-03-04 16:44:31,506 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:31,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:31,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:31,508 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:31,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:31,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:31,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:31,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:31,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:31,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:44:31,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:31,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:31,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:31,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:31,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,989 INFO L301 Elim1Store]: Index analysis took 113 ms [2019-03-04 16:44:31,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:31,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:31,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:32,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:44:32,028 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,039 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,049 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,060 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,071 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:44:32,098 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,103 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,112 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,131 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:32,131 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:44:32,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:44:32,159 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,169 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:44:32,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:44:32,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,197 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,197 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-03-04 16:44:32,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:44:32,230 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,235 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:32,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-03-04 16:44:32,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:44:32,268 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:32,275 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:32,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-03-04 16:44:32,291 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:44:32,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:32,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:32,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:44:32,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:32,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:44:32,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:44:32,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:44:32,353 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-03-04 16:44:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:34,722 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-03-04 16:44:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:44:34,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:44:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:34,724 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:44:34,724 INFO L226 Difference]: Without dead ends: 477 [2019-03-04 16:44:34,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:44:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-03-04 16:44:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-03-04 16:44:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:44:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-03-04 16:44:35,664 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-03-04 16:44:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:35,664 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-03-04 16:44:35,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:44:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-03-04 16:44:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:35,665 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:35,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:35,665 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-03-04 16:44:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:35,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:35,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:35,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:35,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:35,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:44:35,729 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:44:35,730 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:35,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:35,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:35,732 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:35,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:35,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:35,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 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:44:35,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:35,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:35,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:44:35,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:35,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:35,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:35,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:35,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:35,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:35,815 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:44:35,815 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,825 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,835 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,846 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,854 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:44:35,889 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,893 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,904 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,919 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:35,947 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:35,947 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:44:35,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:44:35,982 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:36,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:36,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:44:36,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:44:36,046 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:36,058 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:36,059 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:44:36,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:44:36,093 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:36,103 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:36,103 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:44:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:36,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:44:36,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:36,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:44:36,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:44:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:44:36,174 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-03-04 16:44:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:38,047 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-03-04 16:44:38,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:44:38,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:44:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:38,049 INFO L225 Difference]: With dead ends: 250 [2019-03-04 16:44:38,049 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:44:38,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:44:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:44:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-03-04 16:44:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:44:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-03-04 16:44:39,521 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-03-04 16:44:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:39,521 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-03-04 16:44:39,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:44:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-03-04 16:44:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:39,522 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:39,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:39,522 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-03-04 16:44:39,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:39,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:39,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:39,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:39,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:44:39,640 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-03-04 16:44:39,641 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:39,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:39,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:39,643 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:39,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:39,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:39,644 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:44:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:39,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:44:39,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:39,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:39,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:39,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:39,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:39,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:39,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:44:39,735 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,744 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,755 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,765 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,776 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,801 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:44:39,802 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,806 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,815 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:39,835 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:44:39,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:44:39,867 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,875 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:44:39,900 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:44:39,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,909 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:39,909 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-03-04 16:44:39,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:44:39,948 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:39,957 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:39,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-03-04 16:44:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:39,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:40,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:40,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:44:40,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:40,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:44:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:44:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:44:40,022 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-03-04 16:44:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:43,253 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-03-04 16:44:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:44:43,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:44:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:43,254 INFO L225 Difference]: With dead ends: 372 [2019-03-04 16:44:43,254 INFO L226 Difference]: Without dead ends: 362 [2019-03-04 16:44:43,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:44:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-03-04 16:44:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-03-04 16:44:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-03-04 16:44:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-03-04 16:44:45,613 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-03-04 16:44:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:45,613 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-03-04 16:44:45,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:44:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-03-04 16:44:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:45,614 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:45,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:45,614 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-03-04 16:44:45,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:45,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:45,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:45,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:45,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:45,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:45,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:45,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:45,693 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:44:45,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:45,694 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:44:45,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:44:45,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:44:45,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:44:45,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:45,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:44:45,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:45,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:45,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:45,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:45,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:45,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:45,898 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:44:45,898 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,909 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,918 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,927 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,938 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:44:45,974 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,980 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:45,989 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:46,004 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:46,031 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:46,031 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:44:46,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:44:46,054 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:46,079 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:46,080 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:44:46,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:44:46,121 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:44:46,161 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:44:46,162 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:44:46,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:44:46,224 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:46,239 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:46,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2019-03-04 16:44:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:46,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:46,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:46,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:44:46,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:44:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:44:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:44:46,326 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-03-04 16:44:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:49,262 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-03-04 16:44:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:44:49,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:44:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:49,264 INFO L225 Difference]: With dead ends: 332 [2019-03-04 16:44:49,264 INFO L226 Difference]: Without dead ends: 325 [2019-03-04 16:44:49,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:44:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-03-04 16:44:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-03-04 16:44:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-03-04 16:44:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-03-04 16:44:51,725 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-03-04 16:44:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:51,725 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-03-04 16:44:51,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:44:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-03-04 16:44:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:51,726 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:51,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:51,726 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-03-04 16:44:51,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:51,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:51,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:51,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:51,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:51,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:44:51,819 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-03-04 16:44:51,819 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:51,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:51,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:51,822 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:51,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:51,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:51,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:51,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:51,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:44:51,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:51,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:44:51,856 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,863 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,875 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,891 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:51,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:51,928 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:51,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:51,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:44:51,939 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,948 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,958 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,967 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:51,977 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:52,003 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:52,003 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:44:52,050 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:44:52,050 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:52,066 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:52,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:44:52,099 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:44:52,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:52,112 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:52,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:44:52,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 40 [2019-03-04 16:44:52,158 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:52,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:52,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:44:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:52,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:52,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:52,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:44:52,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:52,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:44:52,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:44:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:44:52,259 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-03-04 16:44:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:54,878 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-03-04 16:44:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:44:54,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:44:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:54,880 INFO L225 Difference]: With dead ends: 294 [2019-03-04 16:44:54,880 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 16:44:54,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:44:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 16:44:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-03-04 16:44:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-03-04 16:44:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-03-04 16:44:57,339 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-03-04 16:44:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:57,339 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-03-04 16:44:57,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:44:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-03-04 16:44:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:44:57,340 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:57,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:57,340 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-03-04 16:44:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:57,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:57,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:57,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:57,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:57,468 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:44:57,468 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-03-04 16:44:57,469 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:57,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:57,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:57,472 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:57,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:57,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:57,473 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:44:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:57,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:57,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:44:57,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:57,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:44:57,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:44:57,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:44:57,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:44:57,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:57,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:44:57,552 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,560 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,571 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,581 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,590 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:44:57,627 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,631 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,640 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,655 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:57,683 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:44:57,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:44:57,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,743 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:57,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:44:57,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:44:57,791 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:44:57,827 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:44:57,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:44:57,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:44:57,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:57,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:44:57,999 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:58,028 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:44:58,029 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-03-04 16:44:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:58,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:58,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:58,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:44:58,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:58,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:44:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:44:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:44:58,166 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-03-04 16:44:58,552 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-03-04 16:44:58,784 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-03-04 16:45:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:01,925 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-03-04 16:45:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:45:01,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:45:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:01,927 INFO L225 Difference]: With dead ends: 364 [2019-03-04 16:45:01,928 INFO L226 Difference]: Without dead ends: 357 [2019-03-04 16:45:01,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:45:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-03-04 16:45:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-03-04 16:45:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 16:45:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-03-04 16:45:04,507 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-03-04 16:45:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-03-04 16:45:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:45:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-03-04 16:45:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:45:04,508 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:04,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:04,509 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-03-04 16:45:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:04,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:04,888 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-03-04 16:45:05,226 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-03-04 16:45:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:45:05,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:05,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:05,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:45:05,370 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 16:45:05,371 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:45:05,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:45:05,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:45:05,374 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:45:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:05,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:45:05,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:05,375 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:45:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:05,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:05,391 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:45:05,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:05,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:45:05,405 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:45:05,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:45:05,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:45:05,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:45:05,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:45:05,444 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,453 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,464 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,475 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,486 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:45:05,523 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,529 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,541 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,557 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,585 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:05,586 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:45:05,629 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:45:05,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,647 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:05,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:45:05,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:45:05,679 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:05,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:45:05,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:45:05,735 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:05,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:05,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:45:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:05,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:05,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:45:05,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:05,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:45:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:45:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:45:05,817 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-03-04 16:45:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:08,921 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-03-04 16:45:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:45:08,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:45:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:08,923 INFO L225 Difference]: With dead ends: 319 [2019-03-04 16:45:08,923 INFO L226 Difference]: Without dead ends: 312 [2019-03-04 16:45:08,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:45:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-03-04 16:45:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-03-04 16:45:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 16:45:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-03-04 16:45:11,903 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-03-04 16:45:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:11,903 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-03-04 16:45:11,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:45:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-03-04 16:45:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:45:11,904 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:11,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:11,904 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-03-04 16:45:11,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:11,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:45:12,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:12,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:12,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:45:12,059 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-03-04 16:45:12,060 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:45:12,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:45:12,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:45:12,062 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:45:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:12,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:45:12,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:12,063 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:45:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:12,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:12,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:45:12,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:12,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:45:12,101 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,106 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,118 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,137 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:45:12,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:45:12,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:45:12,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:45:12,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:45:12,191 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,201 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,211 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,221 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,231 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,259 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:12,260 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:45:12,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:45:12,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:45:12,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:45:12,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:45:12,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:45:12,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:45:12,514 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,546 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:45:12,546 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-03-04 16:45:12,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:45:12,618 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:45:12,689 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:12,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:45:12,719 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-03-04 16:45:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:12,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:12,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:12,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:45:12,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:12,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:45:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:45:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:45:12,868 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-03-04 16:45:14,215 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-03-04 16:45:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:17,257 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-03-04 16:45:17,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:45:17,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:45:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:17,259 INFO L225 Difference]: With dead ends: 392 [2019-03-04 16:45:17,259 INFO L226 Difference]: Without dead ends: 386 [2019-03-04 16:45:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:45:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-03-04 16:45:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-03-04 16:45:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-03-04 16:45:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-03-04 16:45:20,417 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-03-04 16:45:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:20,417 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-03-04 16:45:20,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:45:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-03-04 16:45:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:45:20,418 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:20,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:20,418 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-03-04 16:45:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:20,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:45:20,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:45:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:45:20,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:45:20,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:45:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:45:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:45:20,494 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-03-04 16:45:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:23,504 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-03-04 16:45:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:45:23,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:45:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:23,506 INFO L225 Difference]: With dead ends: 320 [2019-03-04 16:45:23,506 INFO L226 Difference]: Without dead ends: 315 [2019-03-04 16:45:23,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:45:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-03-04 16:45:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-03-04 16:45:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-03-04 16:45:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-03-04 16:45:26,673 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-03-04 16:45:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-03-04 16:45:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:45:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-03-04 16:45:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:45:26,674 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:26,674 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:26,675 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-03-04 16:45:26,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:26,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:45:26,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:26,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:26,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:26,755 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:45:26,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:26,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:45:26,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:45:26,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:45:26,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:45:26,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:26,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:45:26,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:26,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:45:26,796 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,803 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,815 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,830 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:45:26,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:45:26,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:45:26,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:45:26,879 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:45:26,880 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,890 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,900 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,910 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,919 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:26,947 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:26,948 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:45:26,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:45:26,974 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:27,001 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:27,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:45:27,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 38 treesize of output 57 [2019-03-04 16:45:27,064 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:27,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:27,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2019-03-04 16:45:27,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:45:27,137 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:45:27,175 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:45:27,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 16:45:27,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:45:27,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:27,242 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:27,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:45:27,265 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:45:27,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:27,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:27,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:45:27,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:27,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:45:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:45:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:45:27,350 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-03-04 16:45:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:33,772 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-03-04 16:45:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:45:33,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:45:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:33,774 INFO L225 Difference]: With dead ends: 601 [2019-03-04 16:45:33,774 INFO L226 Difference]: Without dead ends: 591 [2019-03-04 16:45:33,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:45:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-03-04 16:45:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-03-04 16:45:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-03-04 16:45:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-03-04 16:45:39,047 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-03-04 16:45:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:39,047 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-03-04 16:45:39,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:45:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-03-04 16:45:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:45:39,048 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:39,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:39,048 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-03-04 16:45:39,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:39,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:39,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:45:39,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:39,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:39,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:45:39,203 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 16:45:39,204 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:45:39,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:45:39,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:45:39,206 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:45:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:39,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:45:39,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:39,206 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:45:39,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:39,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:39,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:45:39,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:39,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:45:39,243 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,247 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,256 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,276 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,301 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:45:39,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:45:39,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:45:39,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:45:39,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:45:39,329 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,339 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,349 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,359 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,369 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,397 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:39,397 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:45:39,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:45:39,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,449 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:39,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:45:39,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:45:39,489 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:39,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:39,508 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 16:45:39,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:45:39,565 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:45:39,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:45:39,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2019-03-04 16:45:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:39,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:39,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:39,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:45:39,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:39,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:45:39,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:45:39,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:45:39,696 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-03-04 16:45:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:49,593 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-03-04 16:45:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:45:49,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:45:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:49,596 INFO L225 Difference]: With dead ends: 731 [2019-03-04 16:45:49,596 INFO L226 Difference]: Without dead ends: 718 [2019-03-04 16:45:49,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:45:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-03-04 16:45:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-03-04 16:45:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-03-04 16:45:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-03-04 16:45:58,266 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-03-04 16:45:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:58,266 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-03-04 16:45:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:45:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-03-04 16:45:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:45:58,267 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:58,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:45:58,268 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-03-04 16:45:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:58,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:45:58,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:58,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:58,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:45:58,385 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:45:58,390 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:45:58,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:45:58,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:45:58,392 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:45:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:58,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:45:58,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:58,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 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 16:45:58,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:58,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:58,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:45:58,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:58,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:45:58,440 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,447 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,461 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,481 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:45:58,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:45:58,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:45:58,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:45:58,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:45:58,534 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,544 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,554 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,563 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,574 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:58,601 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:45:58,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:45:58,650 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,667 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:35 [2019-03-04 16:45:58,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:45:58,699 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,709 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:58,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-03-04 16:45:58,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:45:58,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:58,760 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:58,761 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:45:59,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:45:59,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:59,203 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:45:59,203 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-03-04 16:45:59,226 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:45:59,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:45:59,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:59,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:45:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:45:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:45:59,311 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-03-04 16:46:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:10,552 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-03-04 16:46:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:46:10,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:46:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:10,554 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:46:10,554 INFO L226 Difference]: Without dead ends: 473 [2019-03-04 16:46:10,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:46:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-03-04 16:46:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-03-04 16:46:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:46:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-03-04 16:46:13,906 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-03-04 16:46:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:13,906 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-03-04 16:46:13,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:46:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-03-04 16:46:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:46:13,907 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:13,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:46:13,907 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-03-04 16:46:13,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:13,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:13,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:14,098 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:46:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:46:14,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:14,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:14,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:46:14,156 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 16:46:14,157 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:46:14,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:46:14,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:46:14,162 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:46:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:14,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:46:14,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:14,163 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 16:46:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:14,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:46:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:14,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:46:14,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:14,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:46:14,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:46:14,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:46:14,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:46:14,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:14,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:46:14,233 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,244 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,255 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,266 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,277 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,313 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:46:14,313 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,318 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,328 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,344 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:14,372 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:46:14,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:46:14,418 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,434 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:14,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:46:14,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:46:14,469 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,481 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:14,482 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:46:14,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:46:14,554 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:14,567 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:14,567 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:46:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:14,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:14,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:46:14,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:14,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:46:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:46:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:46:14,642 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-03-04 16:46:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:19,952 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-03-04 16:46:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:46:19,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:46:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:19,954 INFO L225 Difference]: With dead ends: 258 [2019-03-04 16:46:19,954 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:46:19,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:46:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:46:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-03-04 16:46:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-03-04 16:46:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-03-04 16:46:24,640 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-03-04 16:46:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:24,640 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-03-04 16:46:24,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:46:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-03-04 16:46:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:46:24,641 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:24,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:46:24,642 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-03-04 16:46:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:24,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:24,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:46:24,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:24,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:24,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:46:24,810 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 16:46:24,811 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:46:24,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:46:24,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:46:24,813 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:46:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:24,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:46:24,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:24,813 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 16:46:24,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:24,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:46:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:24,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:46:24,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:24,833 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:46:24,852 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:46:24,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,868 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:46:24,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:46:24,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:24,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:46:24,904 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,914 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,925 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,936 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,947 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:46:24,983 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:24,991 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,003 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,019 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,046 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,047 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 16:46:25,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:46:25,087 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,110 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:25,111 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-03-04 16:46:25,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:46:25,162 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:46:25,203 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:46:25,203 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:80 [2019-03-04 16:46:25,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:46:25,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 53 [2019-03-04 16:46:25,389 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,430 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:46:25,431 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:70 [2019-03-04 16:46:25,527 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 16:46:25,527 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,586 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:46:25,587 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:25,619 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:46:25,620 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-03-04 16:46:25,707 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:46:25,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:25,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:46:25,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:25,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:46:25,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:46:25,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:46:25,774 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-03-04 16:46:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:32,031 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-03-04 16:46:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:46:32,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:46:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:32,033 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:46:32,033 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:46:32,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:46:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:46:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-03-04 16:46:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:46:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-03-04 16:46:36,817 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-03-04 16:46:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:36,817 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-03-04 16:46:36,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:46:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-03-04 16:46:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:46:36,818 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:36,818 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:46:36,818 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-03-04 16:46:36,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:36,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:46:36,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:36,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:36,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:46:36,939 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-03-04 16:46:36,940 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:46:36,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:46:36,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:46:36,943 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:46:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:36,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:46:36,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:36,944 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 16:46:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:36,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:46:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:36,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:46:36,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:36,970 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:46:36,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:46:36,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:36,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:36,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:46:36,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:36,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:36,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:46:37,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:46:37,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:46:37,018 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,029 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,040 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,051 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,062 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:46:37,097 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,104 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,115 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,131 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,159 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:37,160 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:46:37,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:46:37,178 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,204 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:37,205 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:46:37,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:46:37,242 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:46:37,280 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:46:37,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:46:37,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:46:37,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:37,351 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:37,351 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:46:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:37,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:37,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:46:37,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:37,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:46:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:46:37,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:46:37,413 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-03-04 16:46:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:44,400 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-03-04 16:46:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:46:44,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:46:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:44,402 INFO L225 Difference]: With dead ends: 328 [2019-03-04 16:46:44,402 INFO L226 Difference]: Without dead ends: 315 [2019-03-04 16:46:44,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:46:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-03-04 16:46:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-03-04 16:46:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-03-04 16:46:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-03-04 16:46:51,166 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-03-04 16:46:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:51,166 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-03-04 16:46:51,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:46:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-03-04 16:46:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:46:51,166 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:51,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:46:51,167 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-03-04 16:46:51,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:51,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:46:51,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:51,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:51,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:46:51,283 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-03-04 16:46:51,284 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:46:51,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:46:51,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:46:51,286 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:46:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:51,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:46:51,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:51,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:46:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:51,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:46:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:51,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:46:51,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:51,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:46:51,345 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,351 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,359 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,374 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,392 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,417 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:46:51,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:46:51,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:46:51,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:46:51,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:46:51,428 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,438 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,448 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,458 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,468 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:51,498 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:46:51,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:46:51,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,561 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:51,561 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:46:51,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:46:51,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:51,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:46:51,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:46:51,677 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:51,703 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:46:51,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:46:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:51,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:51,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:46:51,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:51,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:46:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:46:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:46:51,788 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-03-04 16:47:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:01,132 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-03-04 16:47:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:47:01,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:47:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:01,134 INFO L225 Difference]: With dead ends: 326 [2019-03-04 16:47:01,134 INFO L226 Difference]: Without dead ends: 313 [2019-03-04 16:47:01,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:47:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-03-04 16:47:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-03-04 16:47:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-03-04 16:47:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-03-04 16:47:09,374 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-03-04 16:47:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:09,374 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-03-04 16:47:09,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:47:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-03-04 16:47:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:47:09,375 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:09,375 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:47:09,375 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-03-04 16:47:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:09,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:09,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:47:09,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:09,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:09,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:47:09,459 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 16:47:09,460 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:47:09,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:47:09,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:47:09,466 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:47:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:09,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:47:09,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:09,466 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 16:47:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:09,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:09,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:47:09,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:09,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:47:09,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:47:09,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,518 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:47:09,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:47:09,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:09,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:47:09,554 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,564 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,573 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,584 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,595 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:47:09,737 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,742 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,750 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,766 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:09,793 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:47:09,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:47:09,826 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:47:09,872 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:09,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:47:09,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:47:09,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:09,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:33 [2019-03-04 16:47:09,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 36 [2019-03-04 16:47:09,969 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:09,980 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:09,980 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:47:10,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 39 [2019-03-04 16:47:10,025 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:10,034 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:10,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-03-04 16:47:10,055 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:47:10,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:10,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:10,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:47:10,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:10,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:47:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:47:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:47:10,120 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-03-04 16:47:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:21,536 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-03-04 16:47:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:47:21,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:47:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:21,538 INFO L225 Difference]: With dead ends: 400 [2019-03-04 16:47:21,538 INFO L226 Difference]: Without dead ends: 393 [2019-03-04 16:47:21,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:47:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-03-04 16:47:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-03-04 16:47:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-03-04 16:47:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-03-04 16:47:31,916 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-03-04 16:47:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:31,916 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-03-04 16:47:31,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:47:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-03-04 16:47:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:47:31,917 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:31,917 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:47:31,917 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-03-04 16:47:31,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:31,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:32,069 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-03-04 16:47:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:47:32,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:32,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:32,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:47:32,129 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-03-04 16:47:32,130 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:47:32,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:47:32,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:47:32,132 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:47:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:32,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:47:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:32,133 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 16:47:32,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:32,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:32,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:47:32,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:32,152 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:47:32,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:47:32,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:47:32,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:47:32,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:32,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:47:32,209 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,219 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,230 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,241 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,252 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:47:32,289 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,295 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,307 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,321 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,349 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:32,349 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:47:32,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:47:32,382 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:47:32,429 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:32,429 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:47:32,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:47:32,510 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:47:32,577 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:32,612 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:80 [2019-03-04 16:47:32,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 65 [2019-03-04 16:47:32,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,756 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:47:32,757 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,787 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:32,787 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-03-04 16:47:32,879 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 67 [2019-03-04 16:47:32,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,937 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:47:32,937 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:32,968 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 16:47:33,011 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:47:33,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:33,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:47:33,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:33,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:47:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:47:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:47:33,082 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-03-04 16:47:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:45,546 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-03-04 16:47:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:47:45,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:47:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:45,548 INFO L225 Difference]: With dead ends: 441 [2019-03-04 16:47:45,548 INFO L226 Difference]: Without dead ends: 428 [2019-03-04 16:47:45,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:47:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-03-04 16:47:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-03-04 16:47:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-03-04 16:47:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-03-04 16:47:55,976 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-03-04 16:47:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:55,976 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-03-04 16:47:55,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:47:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-03-04 16:47:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:47:55,977 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:55,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:47:55,977 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-03-04 16:47:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:55,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:56,271 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-03-04 16:47:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:47:56,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:56,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:56,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:47:56,353 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 16:47:56,353 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:47:56,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:47:56,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:47:56,356 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:47:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:56,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:47:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:56,356 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 16:47:56,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:56,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:56,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:47:56,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:56,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:47:56,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:47:56,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:47:56,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:47:56,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:47:56,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:47:56,428 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,440 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,451 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,460 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,471 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:47:56,507 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,513 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,521 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,537 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,564 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:47:56,565 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:47:56,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:47:56,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:47:56,660 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:56,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:47:56,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 47 [2019-03-04 16:47:56,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:47:56,824 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,860 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:56,860 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-03-04 16:47:56,929 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:47:56,929 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:56,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:47:56,993 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:57,024 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:57,024 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 16:47:57,089 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 44 [2019-03-04 16:47:57,090 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:57,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 60 [2019-03-04 16:47:57,165 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:57,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:47:57,194 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-03-04 16:47:57,250 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:47:57,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:57,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:57,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:47:57,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:57,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:47:57,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:47:57,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:47:57,319 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-03-04 16:48:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:17,503 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-03-04 16:48:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:48:17,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:48:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:17,505 INFO L225 Difference]: With dead ends: 685 [2019-03-04 16:48:17,506 INFO L226 Difference]: Without dead ends: 677 [2019-03-04 16:48:17,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:48:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-03-04 16:48:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-03-04 16:48:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-03-04 16:48:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-03-04 16:48:33,118 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-03-04 16:48:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:33,118 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-03-04 16:48:33,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:48:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-03-04 16:48:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:48:33,119 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:33,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:48:33,120 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-03-04 16:48:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:33,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:48:33,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:33,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:33,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:33,283 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:48:33,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:33,283 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 16:48:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:48:33,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:48:33,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:48:33,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:33,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:48:33,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:33,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:48:33,326 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,331 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,343 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,359 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,382 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:48:33,397 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:48:33,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:48:33,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:48:33,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:48:33,412 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,421 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,431 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,441 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,451 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,479 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:33,479 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:48:33,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:48:33,520 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:48:33,564 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:48:33,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:48:33,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:48:33,672 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:48:33,751 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,791 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:48:33,791 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-03-04 16:48:33,886 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:48:33,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-03-04 16:48:33,936 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:33,971 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:48:33,972 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:74 [2019-03-04 16:48:34,057 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:48:34,058 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:34,132 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 56 [2019-03-04 16:48:34,133 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:34,160 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:48:34,160 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 16:48:34,215 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:48:34,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:34,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:34,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 16:48:34,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:34,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:48:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:48:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:48:34,291 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-03-04 16:48:34,480 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-03-04 16:48:35,789 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-03-04 16:48:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:49,516 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-03-04 16:48:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:48:49,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:48:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:49,518 INFO L225 Difference]: With dead ends: 550 [2019-03-04 16:48:49,518 INFO L226 Difference]: Without dead ends: 543 [2019-03-04 16:48:49,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:48:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-03-04 16:48:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-03-04 16:48:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:48:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 16:48:52,498 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-03-04 16:48:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:52,498 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 16:48:52,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:48:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 16:48:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:48:52,498 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:52,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:48:52,498 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:52,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:52,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-03-04 16:48:52,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:52,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:52,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:48:52,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:52,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:52,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 16:48:52,653 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 16:48:52,653 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:48:52,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:48:52,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:48:52,655 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:48:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:52,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:48:52,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:52,656 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 16:48:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:52,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:48:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:52,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:48:52,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:52,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:48:52,695 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,700 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,712 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,729 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,748 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:48:52,774 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:48:52,777 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:48:52,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:48:52,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:48:52,784 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,794 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,803 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,813 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,823 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:52,853 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:52,853 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:48:52,913 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:48:52,914 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:53,071 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:53,072 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:48:53,115 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:48:53,115 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:53,137 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:53,137 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:48:53,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:48:53,193 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:53,212 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:53,212 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:48:53,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:48:53,278 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:53,295 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:48:53,295 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:48:53,577 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:48:53,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:53,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:53,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 16:48:53,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:53,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:48:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:48:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:48:53,692 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 16:48:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:59,649 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-03-04 16:48:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:48:59,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:48:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:59,650 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:48:59,650 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:48:59,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:48:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:49:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-03-04 16:49:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:49:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-03-04 16:49:02,908 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-03-04 16:49:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:02,908 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-03-04 16:49:02,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:49:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-03-04 16:49:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:49:02,908 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:02,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:49:02,909 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-03-04 16:49:02,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:02,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 16:49:03,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:03,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:03,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 16:49:03,066 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 16:49:03,067 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:49:03,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:49:03,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:49:03,070 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:49:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:03,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:49:03,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:03,070 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 16:49:03,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:03,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:49:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:03,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:49:03,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:03,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:49:03,114 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,128 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,137 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,153 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:49:03,188 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:49:03,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:49:03,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:49:03,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:49:03,204 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,214 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,224 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,234 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,243 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,271 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 16:49:03,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:49:03,313 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,339 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:03,339 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:48 [2019-03-04 16:49:03,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:49:03,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:49:03,422 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:03,423 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:76 [2019-03-04 16:49:03,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:49:03,538 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:49:03,602 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,633 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:03,633 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-03-04 16:49:03,721 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:49:03,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:49:03,784 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:03,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:03,812 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:66 [2019-03-04 16:49:03,869 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:49:03,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:03,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:49:03,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:03,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:49:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:49:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:49:03,950 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-03-04 16:49:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:10,262 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-03-04 16:49:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:49:10,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 16:49:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:10,263 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:49:10,264 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:49:10,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:49:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:49:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-03-04 16:49:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:49:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 16:49:13,864 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-03-04 16:49:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:13,864 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 16:49:13,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:49:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 16:49:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:49:13,865 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:13,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:49:13,865 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-03-04 16:49:13,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:13,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:13,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:49:14,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:14,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:14,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 16:49:14,012 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 16:49:14,013 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:49:14,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:49:14,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:49:14,015 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:49:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:14,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:49:14,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:14,016 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 16:49:14,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:14,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:49:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:14,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:49:14,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:14,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:49:14,055 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,061 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,070 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,086 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,108 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:49:14,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:49:14,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:49:14,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:49:14,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:49:14,136 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,145 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,154 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,164 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,174 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,201 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:14,201 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:49:14,246 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:49:14,246 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,262 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:14,263 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:49:14,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:49:14,297 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,309 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:14,309 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:49:14,421 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:49:14,421 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,433 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:14,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:49:14,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 43 [2019-03-04 16:49:14,481 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:14,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:14,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:49:14,513 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:49:14,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:14,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 16:49:14,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:49:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:49:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:49:14,571 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 16:49:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:21,895 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-03-04 16:49:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:49:21,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:49:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:21,896 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:49:21,896 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:49:21,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:49:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:49:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-03-04 16:49:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:49:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-03-04 16:49:28,326 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-03-04 16:49:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:28,326 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-03-04 16:49:28,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:49:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-03-04 16:49:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:49:28,327 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:28,327 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:49:28,327 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-03-04 16:49:28,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:28,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:28,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-03-04 16:49:28,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:28,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:28,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:28,443 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:49:28,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:28,444 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 16:49:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:49:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:49:28,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:49:28,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:49:28,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:49:28,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:28,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:49:28,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:49:28,501 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:49:28,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:49:28,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:49:28,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:49:28,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:49:28,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:49:28,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:49:28,549 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,559 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,568 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,577 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,587 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:49:28,606 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,614 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,630 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:49:28,631 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-03-04 16:49:28,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:49:28,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:49:28,686 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:49:28,686 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:43 [2019-03-04 16:49:28,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 24 [2019-03-04 16:49:28,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-03-04 16:49:28,769 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:49:28,785 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-03-04 16:49:28,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:49:28,833 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:49:28,866 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,878 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:28,878 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-03-04 16:49:28,914 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:49:28,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:49:28,956 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:28,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:28,972 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2019-03-04 16:49:29,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:49:29,016 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:29,042 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 16:49:29,043 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:29,056 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:49:29,056 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:38 [2019-03-04 16:49:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:29,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:29,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:29,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 16:49:29,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:29,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:49:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:49:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:49:29,173 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-03-04 16:49:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:36,116 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-03-04 16:49:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:49:36,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-03-04 16:49:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:36,117 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:49:36,117 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:49:36,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:49:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:49:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:49:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:49:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:49:36,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-03-04 16:49:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:36,118 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:49:36,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:49:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:49:36,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:49:36,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:49:36,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:36,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:37,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:42,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:45,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:45,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:46,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:46,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:47,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:47,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:48,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:51,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:51,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:49:51,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:01,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:01,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:05,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:05,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:05,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:05,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:06,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:06,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:06,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:06,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:06,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:08,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:09,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:09,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:12,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:12,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:12,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:13,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:14,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:14,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:14,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:17,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:26,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:29,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:30,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:31,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:34,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:38,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:43,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:47,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:50:48,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:52:45,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:52:45,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent.