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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:33,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:33,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:33,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:33,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:33,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:33,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:33,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:33,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:33,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:33,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:33,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:33,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:33,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:33,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:33,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:33,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:33,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:33,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:33,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:33,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:33,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:33,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:33,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:33,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:33,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:33,677 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:33,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:33,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:33,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:33,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:33,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:33,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:33,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:33,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:33,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:33,683 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:33,695 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:33,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:33,696 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:33,697 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:33,697 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:33,697 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:33,697 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:33,697 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:33,698 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:33,698 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:33,698 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:33,698 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:33,698 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:33,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:33,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:33,699 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:33,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:33,700 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:33,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:33,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:33,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:33,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:33,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:33,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:33,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:33,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:33,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:33,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:33,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:33,703 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:33,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:33,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:33,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:33,704 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:33,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:33,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:33,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:33,749 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:33,750 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:33,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-03-04 16:38:33,751 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-03-04 16:38:33,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:33,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:33,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:33,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:33,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:33,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:33,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:33,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:33,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:33,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:33,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:33,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:33,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:33,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (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:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:33,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:34,289 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:34,289 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-03-04 16:38:34,291 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:34 BoogieIcfgContainer [2019-03-04 16:38:34,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:34,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:34,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:34,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:34,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/2) ... [2019-03-04 16:38:34,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad1e76a and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:34, skipping insertion in model container [2019-03-04 16:38:34,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:34" (2/2) ... [2019-03-04 16:38:34,298 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-03-04 16:38:34,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:34,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-03-04 16:38:34,333 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-03-04 16:38:34,367 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:34,367 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:34,367 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:34,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:34,368 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:34,368 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:34,368 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:34,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:38:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:38:34,403 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:38:34,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-03-04 16:38:34,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:34,633 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:34,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:34,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:34,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:34,668 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-03-04 16:38:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:34,862 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-03-04 16:38:34,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:34,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:38:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:34,877 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:34,878 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:38:34,881 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:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:38:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-03-04 16:38:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:38:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-03-04 16:38:34,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-03-04 16:38:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:34,917 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-03-04 16:38:34,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-03-04 16:38:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:34,918 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:34,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-03-04 16:38:34,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,069 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:35,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:35,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:35,074 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-03-04 16:38:35,122 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:35,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:35,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:35,192 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:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:35,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,200 INFO 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:35,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:35,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:35,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:35,284 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 15 treesize of output 18 [2019-03-04 16:38:35,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,295 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 18 treesize of output 20 [2019-03-04 16:38:35,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,330 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 20 treesize of output 22 [2019-03-04 16:38:35,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,417 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:35,418 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,470 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,520 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,643 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,740 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:38:35,740 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:35,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,892 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:35,893 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,920 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:35,922 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:35,970 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:35,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:36,021 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:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:36,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:36,048 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-03-04 16:38:36,182 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-03-04 16:38:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:36,371 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-03-04 16:38:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:36,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:36,374 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:38:36,374 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:38:36,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:38:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-03-04 16:38:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:38:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-03-04 16:38:36,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-03-04 16:38:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:36,382 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-03-04 16:38:36,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-03-04 16:38:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:36,383 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:36,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:36,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-03-04 16:38:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:36,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,423 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:36,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:36,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:36,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:36,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:36,425 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-03-04 16:38:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:36,532 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-03-04 16:38:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:36,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:36,533 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:38:36,533 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:38:36,534 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:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:38:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:38:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:38:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-03-04 16:38:36,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-03-04 16:38:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:36,538 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-03-04 16:38:36,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-03-04 16:38:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:36,539 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:36,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:36,539 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-03-04 16:38:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,632 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:36,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:36,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:36,633 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-03-04 16:38:36,634 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:36,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:36,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:36,640 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:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:36,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,641 INFO 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:36,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:36,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:36,669 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 15 treesize of output 18 [2019-03-04 16:38:36,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,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, 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 20 [2019-03-04 16:38:36,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,776 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 20 treesize of output 22 [2019-03-04 16:38:36,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,794 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:36,795 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,871 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,985 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,106 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,129 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:37,130 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:37,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,173 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:37,174 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,198 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:37,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:37,262 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:37,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:37,305 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:37,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:37,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:38:37,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:37,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:37,326 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-03-04 16:38:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:37,381 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-03-04 16:38:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:37,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:38:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:37,383 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:38:37,383 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:38:37,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:38:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:38:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:38:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-03-04 16:38:37,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-03-04 16:38:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:37,390 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-03-04 16:38:37,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-03-04 16:38:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:37,391 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:37,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:37,392 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-03-04 16:38:37,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,466 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:37,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:37,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:37,467 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-03-04 16:38:37,470 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:37,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:37,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:37,476 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:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:37,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,476 INFO 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:37,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:37,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:37,511 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 15 treesize of output 18 [2019-03-04 16:38:37,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,527 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 18 treesize of output 20 [2019-03-04 16:38:37,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,544 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 20 treesize of output 22 [2019-03-04 16:38:37,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,564 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:37,565 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,578 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,590 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,640 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,655 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:38:37,655 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:37,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,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, 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:37,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,747 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:37,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:37,769 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:37,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:37,793 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:37,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:37,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:37,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:37,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:37,813 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-03-04 16:38:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,061 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-03-04 16:38:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:38,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,063 INFO L225 Difference]: With dead ends: 32 [2019-03-04 16:38:38,063 INFO L226 Difference]: Without dead ends: 31 [2019-03-04 16:38:38,063 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:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-03-04 16:38:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-03-04 16:38:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:38:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-03-04 16:38:38,069 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-03-04 16:38:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,070 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-03-04 16:38:38,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-03-04 16:38:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:38,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:38,071 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-03-04 16:38:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,144 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:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,145 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:38,145 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-03-04 16:38:38,149 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:38,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:38,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:38,156 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:38:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,157 INFO 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:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,203 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 15 treesize of output 18 [2019-03-04 16:38:38,249 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 18 treesize of output 23 [2019-03-04 16:38:38,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,287 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:38:38,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,312 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:38:38,313 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,321 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,332 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,342 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,357 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:38:38,357 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:38:38,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,412 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:38:38,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,424 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:38:38,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:38,441 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:38,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:38,497 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:38,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:38,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:38:38,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:38,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:38,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:38,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:38,518 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-03-04 16:38:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,559 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-03-04 16:38:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:38,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:38:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,561 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:38:38,561 INFO L226 Difference]: Without dead ends: 21 [2019-03-04 16:38:38,562 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:38:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-03-04 16:38:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-03-04 16:38:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:38:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-03-04 16:38:38,568 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-03-04 16:38:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,568 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-03-04 16:38:38,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-03-04 16:38:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:38,569 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:38,569 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-03-04 16:38:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,707 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:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:38,708 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-03-04 16:38:38,710 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:38,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:38,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:38,715 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:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:38,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,715 INFO 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:38:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,750 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 15 treesize of output 18 [2019-03-04 16:38:38,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,760 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 18 treesize of output 20 [2019-03-04 16:38:38,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,784 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 20 treesize of output 22 [2019-03-04 16:38:38,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,813 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:38,813 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,824 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,834 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,843 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,858 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:38:38,859 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:38,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,985 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:38,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,010 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:38:39,011 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:39,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,061 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:38:39,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,075 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:39,075 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:38:39,093 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:39,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,129 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:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:39,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:39,150 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-03-04 16:38:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:39,469 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-03-04 16:38:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:39,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:39,471 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:38:39,471 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:38:39,472 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:38:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:38:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-03-04 16:38:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-03-04 16:38:39,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-03-04 16:38:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:39,479 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-03-04 16:38:39,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-03-04 16:38:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:39,479 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:39,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:39,480 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-03-04 16:38:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,594 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:39,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:39,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:39,595 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-03-04 16:38:39,598 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:39,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:39,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:39,603 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:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:39,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,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 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:38:39,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:39,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:39,626 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 15 treesize of output 18 [2019-03-04 16:38:39,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,665 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 18 treesize of output 20 [2019-03-04 16:38:39,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,671 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 20 treesize of output 22 [2019-03-04 16:38:39,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,703 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:39,704 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,721 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,729 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,737 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,752 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:38:39,752 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:39,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,780 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:39,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,795 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:38:39,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:39,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,866 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:38:39,867 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,880 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:39,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:39,899 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:39,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,925 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:38:39,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:39,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:39,946 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-03-04 16:38:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:40,454 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-03-04 16:38:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:40,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:40,456 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:38:40,456 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:38:40,457 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:38:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:38:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-03-04 16:38:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:38:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-03-04 16:38:40,466 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-03-04 16:38:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:40,466 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-03-04 16:38:40,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-03-04 16:38:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:40,467 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:40,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:40,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-03-04 16:38:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,567 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:40,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:40,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:40,568 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-03-04 16:38:40,571 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:40,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:40,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:40,575 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:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:40,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,576 INFO 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:38:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:40,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:40,603 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 15 treesize of output 18 [2019-03-04 16:38:40,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,609 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 18 treesize of output 20 [2019-03-04 16:38:40,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,625 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 20 treesize of output 22 [2019-03-04 16:38:40,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:40,649 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,657 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,663 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,671 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,685 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:38:40,685 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:40,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,880 INFO L301 Elim1Store]: Index analysis took 129 ms [2019-03-04 16:38:40,881 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:40,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,951 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:38:40,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:40,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,997 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:40,998 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,014 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:41,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:41,035 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:41,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:41,058 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:38:41,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:41,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:41,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:41,078 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-03-04 16:38:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:41,430 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-03-04 16:38:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:41,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:41,431 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:38:41,432 INFO L226 Difference]: Without dead ends: 48 [2019-03-04 16:38:41,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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:38:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-03-04 16:38:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-03-04 16:38:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:38:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-03-04 16:38:41,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-03-04 16:38:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:41,441 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-03-04 16:38:41,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-03-04 16:38:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:41,442 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:41,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:41,443 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-03-04 16:38:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,510 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:41,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:41,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:41,511 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-03-04 16:38:41,514 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:41,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:41,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:41,519 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:38:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:41,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,519 INFO 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:38:41,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:41,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:41,543 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 15 treesize of output 18 [2019-03-04 16:38:41,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,566 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 18 treesize of output 20 [2019-03-04 16:38:41,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,578 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 20 treesize of output 22 [2019-03-04 16:38:41,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:41,650 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,658 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,665 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,674 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,689 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:38:41,689 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:41,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,721 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:41,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,741 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:41,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:41,757 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:41,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:41,811 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:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:41,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:41,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:41,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:41,831 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-03-04 16:38:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:41,943 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-03-04 16:38:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:41,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:41,945 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:38:41,945 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:38:41,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:38:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-03-04 16:38:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:38:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-03-04 16:38:41,953 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-03-04 16:38:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:41,954 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-03-04 16:38:41,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-03-04 16:38:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:41,954 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:41,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:41,955 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-03-04 16:38:41,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,029 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:42,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:42,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:42,030 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-03-04 16:38:42,032 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:42,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:42,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:42,036 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:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:42,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,037 INFO 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:38:42,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:42,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:42,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:38:42,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,065 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 18 treesize of output 20 [2019-03-04 16:38:42,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,095 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 20 treesize of output 22 [2019-03-04 16:38:42,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,107 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:42,108 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,118 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,126 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,153 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,171 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:38:42,172 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:42,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,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, 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:42,205 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,235 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:38:42,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:42,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,262 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:42,263 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,277 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:42,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:42,291 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:42,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:42,349 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:38:42,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:42,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:42,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:42,368 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-03-04 16:38:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:42,788 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-03-04 16:38:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:42,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:42,790 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:38:42,790 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:38:42,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:38:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-03-04 16:38:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:38:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-03-04 16:38:42,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-03-04 16:38:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:42,801 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-03-04 16:38:42,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-03-04 16:38:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:42,801 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:42,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:42,802 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-03-04 16:38:42,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,941 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:42,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:42,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:42,942 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-03-04 16:38:42,943 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:42,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:42,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:42,946 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:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:42,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,947 INFO 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:38:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:42,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:42,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 15 treesize of output 18 [2019-03-04 16:38:42,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,978 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 18 treesize of output 20 [2019-03-04 16:38:42,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,997 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 20 treesize of output 22 [2019-03-04 16:38:43,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:43,017 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,029 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,039 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,126 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,144 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:38:43,145 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:43,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,184 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:43,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,205 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:38:43,205 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:43,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,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, 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:38:43,263 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,280 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:43,280 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:43,306 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:43,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,344 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:38:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:43,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:43,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:43,365 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-03-04 16:38:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:43,655 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-03-04 16:38:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:43,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:43,656 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:38:43,657 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:38:43,657 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:38:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:38:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-03-04 16:38:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:38:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-03-04 16:38:43,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-03-04 16:38:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:43,666 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-03-04 16:38:43,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-03-04 16:38:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:43,667 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:43,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:43,668 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,668 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-03-04 16:38:43,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,733 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:43,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:43,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:43,734 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-03-04 16:38:43,735 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:43,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:43,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:43,739 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:38:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:43,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,739 INFO 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:38:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:43,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:43,757 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 15 treesize of output 18 [2019-03-04 16:38:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:38:43,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,805 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:38:43,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,822 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:38:43,823 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,831 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,839 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,847 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,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:38:43,860 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:38:43,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,933 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:38:43,934 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,946 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:38:43,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:43,960 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:43,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,971 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:43,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:43,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:43,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:43,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:43,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:43,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:43,991 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-03-04 16:38:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,106 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-03-04 16:38:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:44,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,108 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:38:44,108 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:38:44,108 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:38:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:38:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-03-04 16:38:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:38:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-03-04 16:38:44,117 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-03-04 16:38:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,117 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-03-04 16:38:44,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-03-04 16:38:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:44,118 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:44,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-03-04 16:38:44,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,255 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:38:44,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:44,256 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-03-04 16:38:44,257 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:44,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:44,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:44,262 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:38:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:44,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,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 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:38:44,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:44,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:44,281 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 15 treesize of output 18 [2019-03-04 16:38:44,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,291 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 18 treesize of output 20 [2019-03-04 16:38:44,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,301 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 20 treesize of output 22 [2019-03-04 16:38:44,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,315 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:44,316 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,330 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,339 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,347 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,363 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:38:44,363 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:44,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,406 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:44,406 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,422 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:38:44,422 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:44,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,453 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:38:44,453 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,468 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:44,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:44,486 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:44,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:44,511 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:38:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:44,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:44,531 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-03-04 16:38:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,810 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-03-04 16:38:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:44,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,812 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:38:44,812 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:38:44,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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:38:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:38:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-03-04 16:38:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:38:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-03-04 16:38:44,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-03-04 16:38:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,821 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-03-04 16:38:44,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-03-04 16:38:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:44,822 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:44,822 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-03-04 16:38:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,010 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:38:45,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:45,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:45,011 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-03-04 16:38:45,011 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:45,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:45,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:45,015 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:38:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:45,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,015 INFO 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:38:45,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:45,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:45,036 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 15 treesize of output 18 [2019-03-04 16:38:45,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,041 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 18 treesize of output 20 [2019-03-04 16:38:45,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,048 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 20 treesize of output 22 [2019-03-04 16:38:45,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,058 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:45,059 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,072 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,080 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,088 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,101 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:38:45,102 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:45,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,131 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:45,132 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,148 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:38:45,148 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:45,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,178 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:38:45,179 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,199 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:38:45,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:45,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,228 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:38:45,229 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,247 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:45,247 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:38:45,261 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:38:45,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:45,330 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:38:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:45,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:45,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:45,354 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-03-04 16:38:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:45,894 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-03-04 16:38:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:45,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:45,896 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:38:45,896 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:38:45,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:38:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:38:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-03-04 16:38:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:38:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-03-04 16:38:45,908 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-03-04 16:38:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:45,909 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-03-04 16:38:45,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-03-04 16:38:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:45,910 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:45,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:45,910 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-03-04 16:38:45,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:46,221 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-03-04 16:38:46,253 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:38:46,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:46,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:46,255 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-03-04 16:38:46,256 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:46,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:46,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:46,259 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:38:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:46,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:46,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,260 INFO 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:38:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:46,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:46,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:46,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:46,315 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 15 treesize of output 18 [2019-03-04 16:38:46,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,356 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 18 treesize of output 20 [2019-03-04 16:38:46,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,388 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 20 treesize of output 22 [2019-03-04 16:38:46,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:46,399 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,408 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,417 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,426 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,441 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,442 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:46,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,470 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:46,471 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,485 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:38:46,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:46,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,517 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:38:46,518 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,533 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:38:46,534 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:38:46,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,569 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 35 treesize of output 30 [2019-03-04 16:38:46,569 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,584 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:46,584 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:38:46,602 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:38:46,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:46,641 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:38:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:46,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:46,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:46,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:46,661 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-03-04 16:38:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:47,085 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-03-04 16:38:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:47,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:47,087 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:38:47,087 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:38:47,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:38:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-03-04 16:38:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:38:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-03-04 16:38:47,098 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-03-04 16:38:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:47,098 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-03-04 16:38:47,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-03-04 16:38:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:47,099 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:47,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:47,100 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-03-04 16:38:47,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,182 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:47,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:47,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:47,183 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-03-04 16:38:47,184 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:47,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:47,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:47,187 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:38:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:47,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,188 INFO 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:38:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:47,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:47,242 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 15 treesize of output 18 [2019-03-04 16:38:47,252 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 18 treesize of output 23 [2019-03-04 16:38:47,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:38:47,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,282 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:38:47,283 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,290 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,299 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,313 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,324 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:38:47,325 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:38:47,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,355 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:38:47,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,363 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:38:47,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:47,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,386 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 28 treesize of output 23 [2019-03-04 16:38:47,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,401 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:38:47,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:38:47,415 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:47,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:47,435 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:38:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:47,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:47,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:47,455 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-03-04 16:38:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:47,664 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-03-04 16:38:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:47,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:47,665 INFO L225 Difference]: With dead ends: 58 [2019-03-04 16:38:47,666 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:38:47,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:38:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-03-04 16:38:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:38:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-03-04 16:38:47,678 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-03-04 16:38:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:47,678 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-03-04 16:38:47,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-03-04 16:38:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:47,679 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:47,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:47,679 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-03-04 16:38:47,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:47,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,810 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:38:47,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:47,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:47,811 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:38:47,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,811 INFO 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:38:47,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:47,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:47,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:38:47,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:47,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:47,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:47,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:38:47,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,836 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 18 treesize of output 20 [2019-03-04 16:38:47,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,844 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 20 treesize of output 22 [2019-03-04 16:38:47,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,015 INFO L301 Elim1Store]: Index analysis took 138 ms [2019-03-04 16:38:48,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:48,016 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,135 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,146 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,157 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,174 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:38:48,175 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:48,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,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, 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:48,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,237 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:38:48,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:48,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,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, 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:48,276 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,292 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:38:48,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:48,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,359 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:38:48,359 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,375 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:48,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:38:48,401 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:38:48,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:48,437 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:38:48,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:48,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:48,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:48,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:48,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:48,457 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-03-04 16:38:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:48,832 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-03-04 16:38:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:48,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:48,834 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:38:48,834 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:38:48,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:38:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:38:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-03-04 16:38:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:38:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-03-04 16:38:48,847 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-03-04 16:38:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:48,847 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-03-04 16:38:48,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-03-04 16:38:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:48,848 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:48,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:48,848 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:48,849 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-03-04 16:38:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:48,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:48,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:48,913 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:38:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:48,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:38:48,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:48,915 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-03-04 16:38:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:49,000 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-03-04 16:38:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:49,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:38:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:49,002 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:38:49,002 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:38:49,002 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:38:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:38:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-03-04 16:38:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:38:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-03-04 16:38:49,012 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-03-04 16:38:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:49,012 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-03-04 16:38:49,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-03-04 16:38:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:49,013 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:49,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:49,013 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-03-04 16:38:49,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,085 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:49,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:49,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:49,086 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-03-04 16:38:49,088 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:49,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:49,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:49,091 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:38:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:49,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:49,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:49,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,114 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 15 treesize of output 18 [2019-03-04 16:38:49,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,118 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 18 treesize of output 20 [2019-03-04 16:38:49,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,140 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 20 treesize of output 22 [2019-03-04 16:38:49,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,157 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:49,157 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,166 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,176 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,205 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,220 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:38:49,221 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:49,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,250 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:49,250 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,265 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:49,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:49,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,311 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:49,311 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,327 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:49,327 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:49,346 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:49,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:49,357 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:38:49,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:49,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:38:49,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:49,378 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-03-04 16:38:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:49,604 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-03-04 16:38:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:49,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:49,605 INFO L225 Difference]: With dead ends: 44 [2019-03-04 16:38:49,605 INFO L226 Difference]: Without dead ends: 43 [2019-03-04 16:38:49,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:38:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-03-04 16:38:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-03-04 16:38:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:38:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-03-04 16:38:49,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-03-04 16:38:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:49,617 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-03-04 16:38:49,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-03-04 16:38:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:49,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:49,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:49,617 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:49,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-03-04 16:38:49,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,859 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-03-04 16:38:49,885 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:38:49,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:49,886 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:49,886 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-03-04 16:38:49,887 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:49,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:49,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:49,891 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:38:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:49,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,891 INFO 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:38:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:49,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,910 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 15 treesize of output 18 [2019-03-04 16:38:49,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,926 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 18 treesize of output 20 [2019-03-04 16:38:49,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,940 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 20 treesize of output 22 [2019-03-04 16:38:49,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,950 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:49,950 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,963 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,974 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,982 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,995 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:38:49,996 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:50,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,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, 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:50,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,034 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:38:50,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:50,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,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, 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:50,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,075 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:50,075 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:50,092 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:50,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:50,115 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:50,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:50,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:50,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:50,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:50,137 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-03-04 16:38:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:50,430 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-03-04 16:38:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:50,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:50,432 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:38:50,432 INFO L226 Difference]: Without dead ends: 48 [2019-03-04 16:38:50,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-03-04 16:38:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-03-04 16:38:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:38:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-03-04 16:38:50,444 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-03-04 16:38:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:50,444 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-03-04 16:38:50,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-03-04 16:38:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:50,445 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:50,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:50,445 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-03-04 16:38:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:50,531 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:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:50,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:50,532 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:38:50,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,532 INFO 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:38:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:50,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:50,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:50,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:50,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:50,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:50,553 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 15 treesize of output 18 [2019-03-04 16:38:50,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,557 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 18 treesize of output 20 [2019-03-04 16:38:50,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,563 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 20 treesize of output 22 [2019-03-04 16:38:50,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:50,573 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,581 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,589 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,597 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,610 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:38:50,611 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:50,817 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-03-04 16:38:50,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,987 INFO L301 Elim1Store]: Index analysis took 144 ms [2019-03-04 16:38:50,988 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:50,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,170 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:38:51,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:51,386 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:38:51,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,542 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:38:51,543 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:38:51,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,730 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:51,730 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:51,911 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:51,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:51,954 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:38:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:51,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:51,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:51,975 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-03-04 16:38:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:52,472 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-03-04 16:38:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:52,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:52,476 INFO L225 Difference]: With dead ends: 58 [2019-03-04 16:38:52,476 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:38:52,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:38:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-03-04 16:38:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:38:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-03-04 16:38:52,490 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-03-04 16:38:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:52,491 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-03-04 16:38:52,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-03-04 16:38:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:52,491 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:52,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:52,492 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-03-04 16:38:52,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:52,585 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:52,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:52,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:52,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:52,586 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-03-04 16:38:52,587 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:52,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:52,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:52,590 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:38:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:52,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:52,591 INFO 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:38:52,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:52,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:52,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:52,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:52,610 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 15 treesize of output 18 [2019-03-04 16:38:52,636 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 18 treesize of output 23 [2019-03-04 16:38:52,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,647 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:38:52,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,662 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:38:52,662 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,681 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,688 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,696 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,706 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:38:52,707 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:38:52,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,736 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:38:52,736 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,746 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:38:52,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:52,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:38:52,770 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,781 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:38:52,781 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:38:52,796 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:52,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:53,220 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:38:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:53,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:53,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:53,280 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-03-04 16:38:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:54,343 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-03-04 16:38:54,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:54,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:54,344 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:38:54,344 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:38:54,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:38:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-03-04 16:38:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:38:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-03-04 16:38:54,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-03-04 16:38:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:54,360 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-03-04 16:38:54,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-03-04 16:38:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:54,361 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:54,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:54,361 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:54,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-03-04 16:38:54,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:54,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:54,432 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:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:54,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:54,433 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-03-04 16:38:54,434 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:54,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:54,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:54,438 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:38:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:54,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,439 INFO 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:38:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:54,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:54,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:38:54,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:54,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:38:54,470 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 18 treesize of output 23 [2019-03-04 16:38:54,499 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 20 treesize of output 28 [2019-03-04 16:38:54,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,523 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 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:38:54,524 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,531 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,634 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,676 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,684 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:54,688 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-03-04 16:38:54,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,739 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:38:54,739 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,744 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:38:54,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:38:54,752 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:54,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:54,756 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:54,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:54,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:38:54,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:54,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:54,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:54,776 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-03-04 16:38:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:54,840 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-03-04 16:38:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:54,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:38:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:54,842 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:38:54,842 INFO L226 Difference]: Without dead ends: 73 [2019-03-04 16:38:54,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-03-04 16:38:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-03-04 16:38:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:38:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-03-04 16:38:54,861 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-03-04 16:38:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:54,861 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-03-04 16:38:54,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-03-04 16:38:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:54,862 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:54,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:54,862 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-03-04 16:38:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:55,145 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-03-04 16:38:55,178 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:38:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:55,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:55,178 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-03-04 16:38:55,179 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:55,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:55,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:55,182 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:38:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:55,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:55,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,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 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:38:55,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:55,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:55,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:55,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:55,205 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 15 treesize of output 18 [2019-03-04 16:38:55,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,207 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 18 treesize of output 20 [2019-03-04 16:38:55,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,214 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 20 treesize of output 22 [2019-03-04 16:38:55,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,224 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:55,224 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,231 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,239 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,247 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,260 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:38:55,260 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:55,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,284 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:55,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,298 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:38:55,299 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:55,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,332 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:55,332 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,351 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:38:55,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:55,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,400 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:55,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,415 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:55,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:55,429 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:38:55,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:38:55,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:55,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:55,476 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-03-04 16:38:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:55,940 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-03-04 16:38:55,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:38:55,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:55,941 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:38:55,942 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:38:55,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:38:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:38:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-03-04 16:38:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:38:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-03-04 16:38:55,964 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-03-04 16:38:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:55,964 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-03-04 16:38:55,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-03-04 16:38:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:55,965 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:55,965 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:38:55,966 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-03-04 16:38:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,026 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:38:56,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:56,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:56,027 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-03-04 16:38:56,027 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:56,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:56,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:56,031 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:38:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:56,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:56,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:56,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 15 treesize of output 18 [2019-03-04 16:38:56,087 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 18 treesize of output 23 [2019-03-04 16:38:56,115 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 20 treesize of output 28 [2019-03-04 16:38:56,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,387 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 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:38:56,388 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,435 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,442 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,449 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,459 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:38:56,459 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:38:56,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,480 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:38:56,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:38:56,509 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, 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 23 treesize of output 18 [2019-03-04 16:38:56,510 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,516 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:38:56,516 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:38:56,527 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:56,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:56,785 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:56,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:56,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:38:56,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:56,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:38:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:38:56,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:56,805 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-03-04 16:38:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:56,969 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-03-04 16:38:56,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:56,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:38:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:56,971 INFO L225 Difference]: With dead ends: 85 [2019-03-04 16:38:56,971 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:38:56,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:38:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-03-04 16:38:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:38:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-03-04 16:38:56,991 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-03-04 16:38:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:56,991 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-03-04 16:38:56,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:38:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-03-04 16:38:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:56,992 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:56,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:56,992 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-03-04 16:38:56,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:56,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,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:38:57,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:57,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:57,100 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-03-04 16:38:57,102 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:57,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:57,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:57,106 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:38:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:57,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,106 INFO 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:38:57,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:57,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:57,126 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 15 treesize of output 18 [2019-03-04 16:38:57,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,130 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 18 treesize of output 20 [2019-03-04 16:38:57,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,140 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 20 treesize of output 22 [2019-03-04 16:38:57,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:57,159 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,177 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,183 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,190 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,205 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:38:57,205 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:57,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,284 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:57,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,298 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:38:57,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:57,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,331 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:38:57,331 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,345 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:57,346 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:57,363 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,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:57,383 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:38:57,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:57,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:57,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:57,402 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-03-04 16:38:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:57,626 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-03-04 16:38:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:57,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:38:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:57,628 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:38:57,628 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:38:57,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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:38:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:38:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-03-04 16:38:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:38:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-03-04 16:38:57,647 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-03-04 16:38:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:57,647 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-03-04 16:38:57,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-03-04 16:38:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:57,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:57,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:57,648 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-03-04 16:38:57,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:57,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,850 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:38:57,896 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:38:57,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:57,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:57,897 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-03-04 16:38:57,898 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:57,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:57,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:57,901 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:38:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:57,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:57,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:57,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:57,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:38:57,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,947 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 18 treesize of output 20 [2019-03-04 16:38:57,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,957 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 20 treesize of output 22 [2019-03-04 16:38:57,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,975 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:57,976 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,991 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,997 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,004 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,018 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:38:58,019 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:58,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,053 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:58,054 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,068 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:38:58,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:58,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,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, 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:38:58,093 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,108 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:58,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:58,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,133 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:38:58,133 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,148 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:58,148 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:38:58,166 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:38:58,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:58,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:38:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:38:58,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:58,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:58,216 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-03-04 16:38:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:58,632 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-03-04 16:38:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:38:58,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:38:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:58,635 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:38:58,635 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:38:58,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:38:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:38:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-03-04 16:38:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:38:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-03-04 16:38:58,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-03-04 16:38:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:58,653 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-03-04 16:38:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-03-04 16:38:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:58,654 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:58,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:58,654 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-03-04 16:38:58,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,817 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:38:58,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:58,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:58,817 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-03-04 16:38:58,818 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:58,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:58,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:58,821 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:38:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:58,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,822 INFO 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:38:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:58,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:58,839 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 15 treesize of output 18 [2019-03-04 16:38:58,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,842 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 18 treesize of output 20 [2019-03-04 16:38:58,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:38:58,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,866 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:38:58,867 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,892 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,934 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,942 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,956 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,956 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:38:58,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,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:38:58,982 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,994 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:38:58,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:59,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,021 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:38:59,022 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,035 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:38:59,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:59,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,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, 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:38:59,064 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,078 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:59,079 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:59,098 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:38:59,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:59,142 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:38:59,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:59,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:59,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:59,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:59,161 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-03-04 16:38:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:59,571 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-03-04 16:38:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:59,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:38:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:59,573 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:38:59,573 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:38:59,573 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:38:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:38:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-03-04 16:38:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:38:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-03-04 16:38:59,600 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-03-04 16:38:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:59,600 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-03-04 16:38:59,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-03-04 16:38:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:59,601 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:59,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:59,601 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-03-04 16:38:59,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:59,734 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:38:59,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:59,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:59,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:59,735 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-03-04 16:38:59,737 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:59,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:59,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:59,740 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:38:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:59,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:59,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:59,740 INFO 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:38:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:59,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:59,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:59,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:59,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:38:59,790 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 18 treesize of output 23 [2019-03-04 16:38:59,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,808 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:38:59,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,823 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:38:59,824 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,830 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,839 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,847 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,860 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:38:59,860 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:38:59,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,892 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:38:59,892 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,902 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:38:59,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:59,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,923 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 28 treesize of output 23 [2019-03-04 16:38:59,923 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,934 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:38:59,934 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-03-04 16:38:59,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,956 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 30 treesize of output 25 [2019-03-04 16:38:59,956 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,966 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:38:59,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-03-04 16:38:59,981 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:38:59,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:00,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:00,034 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-03-04 16:39:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:00,457 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-03-04 16:39:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:00,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:00,459 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:39:00,459 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:39:00,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:39:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-03-04 16:39:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-03-04 16:39:00,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-03-04 16:39:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:00,483 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-03-04 16:39:00,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-03-04 16:39:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:00,484 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:00,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:00,484 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-03-04 16:39:00,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,690 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:39:00,753 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:39:00,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:00,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:00,754 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-03-04 16:39:00,756 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:00,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:00,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:00,759 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:00,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:00,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:00,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:00,802 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 15 treesize of output 18 [2019-03-04 16:39:00,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,809 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 18 treesize of output 20 [2019-03-04 16:39:00,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,823 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 20 treesize of output 22 [2019-03-04 16:39:00,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,835 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:00,835 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,844 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,852 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,860 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,874 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,874 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:00,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,899 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:00,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,914 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:00,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:00,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,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, 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:39:00,941 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,954 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:00,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:01,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,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 35 treesize of output 30 [2019-03-04 16:39:01,081 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,109 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:01,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:01,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,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 35 treesize of output 30 [2019-03-04 16:39:01,156 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,174 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:01,174 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:01,195 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:39:01,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:01,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:01,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:01,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:01,258 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-03-04 16:39:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:02,624 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-03-04 16:39:02,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:02,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:02,626 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:39:02,626 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:39:02,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:39:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-03-04 16:39:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:39:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-03-04 16:39:02,649 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-03-04 16:39:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-03-04 16:39:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-03-04 16:39:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:02,649 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:02,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:02,650 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-03-04 16:39:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:03,369 WARN L181 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:39:03,525 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:39:03,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:03,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:03,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:03,526 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:03,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:03,526 INFO 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:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:03,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:03,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:03,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:03,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:03,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:03,555 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 15 treesize of output 18 [2019-03-04 16:39:03,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,558 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 18 treesize of output 20 [2019-03-04 16:39:03,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,574 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 20 treesize of output 22 [2019-03-04 16:39:03,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:03,591 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,603 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,614 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,624 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,640 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,640 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:03,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,696 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:03,696 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,721 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:03,722 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:03,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,751 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:39:03,752 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,766 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:03,767 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:03,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,793 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:39:03,794 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,808 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:03,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:03,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,835 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:39:03,835 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,849 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:03,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:03,865 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:39:03,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:03,919 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:39:03,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:03,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:03,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:03,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:03,938 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-03-04 16:39:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:04,511 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-03-04 16:39:04,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:04,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:04,514 INFO L225 Difference]: With dead ends: 146 [2019-03-04 16:39:04,514 INFO L226 Difference]: Without dead ends: 145 [2019-03-04 16:39:04,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-03-04 16:39:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-03-04 16:39:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:39:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-03-04 16:39:04,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-03-04 16:39:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:04,540 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-03-04 16:39:04,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-03-04 16:39:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:04,541 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:04,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:04,541 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-03-04 16:39:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:04,624 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:04,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:04,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:04,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:04,625 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-03-04 16:39:04,626 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:04,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:04,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:04,628 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:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:04,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:04,629 INFO 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:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:04,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:04,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:04,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:04,646 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 15 treesize of output 18 [2019-03-04 16:39:04,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,652 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 18 treesize of output 20 [2019-03-04 16:39:04,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,659 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 20 treesize of output 22 [2019-03-04 16:39:04,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,680 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:04,681 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,687 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,695 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,703 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,715 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:04,715 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:04,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,740 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:04,740 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,754 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:04,754 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:04,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,781 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:04,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,796 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:04,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:04,814 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:04,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:04,837 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:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:04,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:39:04,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:04,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:39:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:39:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:04,857 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-03-04 16:39:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:05,109 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-03-04 16:39:05,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:05,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:39:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:05,111 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:39:05,112 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:39:05,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:39:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-03-04 16:39:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:39:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-03-04 16:39:05,135 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-03-04 16:39:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:05,135 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-03-04 16:39:05,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:39:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-03-04 16:39:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:05,136 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:05,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:05,136 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-03-04 16:39:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:05,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:05,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,282 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:05,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:05,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:05,283 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-03-04 16:39:05,284 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:05,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:05,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:05,288 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:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:05,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:05,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,288 INFO 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:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:05,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:05,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:05,307 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 15 treesize of output 18 [2019-03-04 16:39:05,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,312 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 18 treesize of output 20 [2019-03-04 16:39:05,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,319 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 20 treesize of output 22 [2019-03-04 16:39:05,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,347 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:05,347 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,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:05,363 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,371 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,384 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:05,385 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:05,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,422 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:05,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,436 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:05,437 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:05,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,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, 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:05,466 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,480 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:05,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:05,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,508 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:05,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,522 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:05,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:05,541 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:05,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:05,567 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:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:05,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:05,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:05,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:05,587 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-03-04 16:39:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:06,005 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-03-04 16:39:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:06,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:06,007 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:39:06,007 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:39:06,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:39:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-03-04 16:39:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:39:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-03-04 16:39:06,036 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-03-04 16:39:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:06,037 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-03-04 16:39:06,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-03-04 16:39:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:06,037 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:06,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:06,038 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-03-04 16:39:06,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:06,119 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:06,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:06,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:06,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:06,120 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-03-04 16:39:06,121 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:06,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:06,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:06,124 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:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:06,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:06,124 INFO 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:06,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:06,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:06,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:06,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:06,142 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 15 treesize of output 18 [2019-03-04 16:39:06,158 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 18 treesize of output 23 [2019-03-04 16:39:06,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,174 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:39:06,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,198 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:39:06,198 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,205 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,211 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,219 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,230 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:06,230 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:39:06,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,260 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:06,260 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,270 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:06,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:06,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:39:06,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,333 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:06,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:39:06,350 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:06,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:06,370 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:06,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:06,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:06,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:06,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:06,389 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-03-04 16:39:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:06,738 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-03-04 16:39:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:06,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:06,740 INFO L225 Difference]: With dead ends: 143 [2019-03-04 16:39:06,740 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:39:06,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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:39:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:39:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-03-04 16:39:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:39:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-03-04 16:39:06,785 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-03-04 16:39:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:06,785 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-03-04 16:39:06,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-03-04 16:39:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:06,786 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:06,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:06,786 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-03-04 16:39:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:06,971 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-03-04 16:39:07,027 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:07,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:07,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:07,028 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:07,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,028 INFO 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:07,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:07,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:07,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:07,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:07,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:07,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:07,048 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 15 treesize of output 18 [2019-03-04 16:39:07,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,051 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 18 treesize of output 20 [2019-03-04 16:39:07,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,057 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 20 treesize of output 22 [2019-03-04 16:39:07,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,067 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:07,067 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,075 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,081 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39: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:39:07,103 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:07,104 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:07,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,129 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:07,130 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,143 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:07,143 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:07,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,172 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:39:07,173 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,185 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:07,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:07,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,214 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:39:07,215 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,229 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:07,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:07,249 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:07,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:07,281 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:07,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:07,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:07,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:07,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:07,301 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-03-04 16:39:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:07,711 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-03-04 16:39:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:07,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:07,713 INFO L225 Difference]: With dead ends: 196 [2019-03-04 16:39:07,713 INFO L226 Difference]: Without dead ends: 195 [2019-03-04 16:39:07,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-03-04 16:39:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-03-04 16:39:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:39:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-03-04 16:39:07,754 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-03-04 16:39:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:07,755 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-03-04 16:39:07,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-03-04 16:39:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:07,755 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:07,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:07,756 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-03-04 16:39:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:07,948 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:39:07,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:07,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:07,948 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:07,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,949 INFO 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:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:07,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:07,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:07,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:07,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:07,972 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 15 treesize of output 18 [2019-03-04 16:39:07,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,984 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 18 treesize of output 20 [2019-03-04 16:39:08,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,083 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 20 treesize of output 22 [2019-03-04 16:39:08,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,173 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:08,173 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,209 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,217 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,231 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,244 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,244 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:08,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,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:39:08,273 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,285 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:08,286 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:08,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,313 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:39:08,313 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,340 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:08,340 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:08,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,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, 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:39:08,366 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,379 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:08,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:08,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,407 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:39:08,407 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,421 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:08,421 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:08,437 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:39:08,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:08,524 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:39:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:08,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:08,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:08,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:08,543 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-03-04 16:39:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:09,110 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-03-04 16:39:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:09,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:09,113 INFO L225 Difference]: With dead ends: 205 [2019-03-04 16:39:09,113 INFO L226 Difference]: Without dead ends: 197 [2019-03-04 16:39:09,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-03-04 16:39:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-03-04 16:39:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:39:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-03-04 16:39:09,158 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-03-04 16:39:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:09,158 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-03-04 16:39:09,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-03-04 16:39:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:09,159 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:09,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:09,159 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:09,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,159 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-03-04 16:39:09,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,367 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:39:09,426 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:09,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:09,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:09,427 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-03-04 16:39:09,427 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:09,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:09,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:09,431 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:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:09,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,432 INFO 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:09,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:09,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:39:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:09,449 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 15 treesize of output 18 [2019-03-04 16:39:09,467 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 18 treesize of output 23 [2019-03-04 16:39:09,483 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 20 treesize of output 28 [2019-03-04 16:39:09,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,513 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 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:39:09,514 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,521 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,528 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,535 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,556 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:09,557 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:39:09,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,577 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:39:09,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,584 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,584 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-03-04 16:39:09,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,598 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:39:09,598 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,604 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:09,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:39:09,616 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:09,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:09,635 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:09,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:09,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:09,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:09,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:09,656 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-03-04 16:39:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:09,826 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-03-04 16:39:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:09,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:09,828 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:39:09,828 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:39:09,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:39:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-03-04 16:39:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:39:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-03-04 16:39:09,867 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-03-04 16:39:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:09,867 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-03-04 16:39:09,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-03-04 16:39:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:09,867 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:09,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:09,868 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-03-04 16:39:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,109 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-03-04 16:39:10,332 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:39:10,343 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:10,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:10,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:10,344 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-03-04 16:39:10,345 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:10,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:10,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:10,349 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:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:10,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,350 INFO 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:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:10,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,374 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 15 treesize of output 18 [2019-03-04 16:39:10,383 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 18 treesize of output 23 [2019-03-04 16:39:10,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:39:10,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:39:10,410 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,417 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,425 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,432 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,444 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:10,445 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:39:10,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,473 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:10,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,484 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:10,484 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:39:10,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,504 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:10,504 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,513 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:10,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:10,530 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:10,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:10,546 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:10,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:10,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:10,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:10,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:10,566 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-03-04 16:39:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:10,801 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-03-04 16:39:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:10,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:10,803 INFO L225 Difference]: With dead ends: 174 [2019-03-04 16:39:10,803 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:39:10,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:39:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-03-04 16:39:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:39:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-03-04 16:39:10,844 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-03-04 16:39:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:10,844 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-03-04 16:39:10,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-03-04 16:39:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:10,845 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:10,845 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:39:10,846 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-03-04 16:39:10,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:10,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,909 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:10,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:10,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:10,910 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-03-04 16:39:10,910 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:10,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:10,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:10,914 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:39:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:10,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,915 INFO 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:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:39:10,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,944 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 15 treesize of output 18 [2019-03-04 16:39:10,962 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 18 treesize of output 23 [2019-03-04 16:39:10,994 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 20 treesize of output 28 [2019-03-04 16:39:11,017 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 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:39:11,018 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,028 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,036 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,043 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,050 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,050 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-03-04 16:39:11,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, 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:39:11,056 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,057 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,057 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:39:11,063 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:39:11,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,065 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,065 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-03-04 16:39:11,071 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:11,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:11,084 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:39:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:11,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-03-04 16:39:11,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:11,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:39:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:39:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:11,102 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-03-04 16:39:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:11,242 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-03-04 16:39:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:11,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:39:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:11,245 INFO L225 Difference]: With dead ends: 357 [2019-03-04 16:39:11,246 INFO L226 Difference]: Without dead ends: 353 [2019-03-04 16:39:11,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-03-04 16:39:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-03-04 16:39:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-03-04 16:39:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-03-04 16:39:11,379 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-03-04 16:39:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:11,379 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-03-04 16:39:11,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:39:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-03-04 16:39:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:11,381 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:11,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:11,381 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-03-04 16:39:11,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,602 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-03-04 16:39:11,665 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:11,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:11,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:11,666 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-03-04 16:39:11,667 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:11,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:11,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:11,671 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:39:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:11,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,672 INFO 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:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:11,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:11,691 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 15 treesize of output 18 [2019-03-04 16:39:11,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,696 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 18 treesize of output 20 [2019-03-04 16:39:11,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,709 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 20 treesize of output 22 [2019-03-04 16:39:11,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,719 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:11,720 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,744 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,760 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,768 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,783 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:11,784 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:11,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,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, 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:11,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,821 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:11,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:11,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,845 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:39:11,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,860 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,860 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:11,894 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:11,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:11,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:11,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:11,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:11,914 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-03-04 16:39:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:12,233 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-03-04 16:39:12,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:12,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:39:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:12,238 INFO L225 Difference]: With dead ends: 348 [2019-03-04 16:39:12,238 INFO L226 Difference]: Without dead ends: 338 [2019-03-04 16:39:12,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-03-04 16:39:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-03-04 16:39:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-03-04 16:39:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-03-04 16:39:12,324 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-03-04 16:39:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:12,325 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-03-04 16:39:12,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-03-04 16:39:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:12,325 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:12,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:12,326 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-03-04 16:39:12,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,579 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:39:12,641 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:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:12,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:12,642 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-03-04 16:39:12,643 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:12,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:12,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:12,646 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:39:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:12,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,647 INFO 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:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:12,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:12,670 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 15 treesize of output 18 [2019-03-04 16:39:12,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,674 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 18 treesize of output 20 [2019-03-04 16:39:12,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,683 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 20 treesize of output 22 [2019-03-04 16:39:12,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,702 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:12,702 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,709 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,716 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,723 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,736 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,736 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:12,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,763 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,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,777 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:12,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:12,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,804 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:39:12,805 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,817 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,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:12,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,855 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:39:12,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,870 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,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:12,892 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:12,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,928 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:12,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:12,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:12,949 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-03-04 16:39:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:13,367 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-03-04 16:39:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:13,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:39:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:13,371 INFO L225 Difference]: With dead ends: 348 [2019-03-04 16:39:13,371 INFO L226 Difference]: Without dead ends: 343 [2019-03-04 16:39:13,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-03-04 16:39:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-03-04 16:39:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-03-04 16:39:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-03-04 16:39:13,461 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-03-04 16:39:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:13,461 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-03-04 16:39:13,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-03-04 16:39:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:13,462 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:13,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:13,463 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-03-04 16:39:13,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,599 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:39:13,740 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:39:13,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:13,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:13,741 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-03-04 16:39:13,741 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:13,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:13,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:13,744 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:39:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:13,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,745 INFO 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:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:13,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:13,764 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 15 treesize of output 18 [2019-03-04 16:39:13,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,770 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 18 treesize of output 20 [2019-03-04 16:39:13,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,780 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 20 treesize of output 22 [2019-03-04 16:39:13,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,794 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:13,794 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,806 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,822 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,832 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,851 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,851 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:13,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,889 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,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,907 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:13,907 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:13,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,951 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:39:13,952 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,964 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,965 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:14,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,031 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:39:14,031 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,046 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:14,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:14,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,073 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:39:14,074 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,088 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:14,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:14,109 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:39:14,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:14,150 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:39:14,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:14,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:14,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:14,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:14,170 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-03-04 16:39:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,767 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-03-04 16:39:14,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:14,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:39:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,772 INFO L225 Difference]: With dead ends: 457 [2019-03-04 16:39:14,773 INFO L226 Difference]: Without dead ends: 456 [2019-03-04 16:39:14,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-03-04 16:39:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-03-04 16:39:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-03-04 16:39:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-03-04 16:39:14,901 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-03-04 16:39:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,901 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-03-04 16:39:14,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-03-04 16:39:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:14,902 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:14,903 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-03-04 16:39:14,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,128 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-03-04 16:39:15,206 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:39:15,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:15,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:15,207 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:15,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,207 INFO 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:39:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:15,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:15,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:15,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:15,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:15,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:15,234 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 15 treesize of output 18 [2019-03-04 16:39:15,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,270 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 18 treesize of output 20 [2019-03-04 16:39:15,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,275 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 20 treesize of output 22 [2019-03-04 16:39:15,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,365 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:15,365 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,372 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,379 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,387 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,459 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,459 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:15,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,493 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:15,494 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,508 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:15,508 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:15,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,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, 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:39:15,539 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,552 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:15,553 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:15,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,579 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 35 treesize of output 30 [2019-03-04 16:39:15,579 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,593 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:15,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:15,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,622 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 35 treesize of output 30 [2019-03-04 16:39:15,622 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,635 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,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:15,658 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:39:15,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,709 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:39:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:39:15,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:39:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:39:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:15,730 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-03-04 16:39:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:16,256 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-03-04 16:39:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:16,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:39:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:16,260 INFO L225 Difference]: With dead ends: 346 [2019-03-04 16:39:16,261 INFO L226 Difference]: Without dead ends: 345 [2019-03-04 16:39:16,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-03-04 16:39:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-03-04 16:39:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:39:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-03-04 16:39:16,344 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-03-04 16:39:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:16,344 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-03-04 16:39:16,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:39:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-03-04 16:39:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:16,345 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:16,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:16,345 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-03-04 16:39:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,462 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:16,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:16,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:16,463 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-03-04 16:39:16,464 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:16,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:16,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:16,468 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:39:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:16,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,468 INFO 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:39:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:16,492 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 15 treesize of output 18 [2019-03-04 16:39:16,504 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 18 treesize of output 23 [2019-03-04 16:39:16,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,526 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:39:16,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,541 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:39:16,542 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,548 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,556 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,564 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,574 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:16,575 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:39:16,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,604 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:16,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,615 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:16,615 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:16,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,634 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 28 treesize of output 23 [2019-03-04 16:39:16,635 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,645 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,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:39:16,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,680 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 30 treesize of output 25 [2019-03-04 16:39:16,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,689 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,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-03-04 16:39:16,706 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:16,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:16,737 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:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:16,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:16,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:16,757 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-03-04 16:39:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:17,121 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-03-04 16:39:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:17,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:39:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:17,124 INFO L225 Difference]: With dead ends: 280 [2019-03-04 16:39:17,124 INFO L226 Difference]: Without dead ends: 277 [2019-03-04 16:39:17,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-03-04 16:39:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-03-04 16:39:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-03-04 16:39:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-03-04 16:39:17,224 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-03-04 16:39:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:17,225 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-03-04 16:39:17,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-03-04 16:39:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:17,225 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:17,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:17,226 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-03-04 16:39:17,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,332 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,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:17,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:17,333 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-03-04 16:39:17,334 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:17,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:17,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:17,337 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:39:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,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 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:39:17,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:39:17,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:17,355 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 15 treesize of output 18 [2019-03-04 16:39:17,369 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 18 treesize of output 23 [2019-03-04 16:39:17,397 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 20 treesize of output 28 [2019-03-04 16:39:17,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,417 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 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:39:17,418 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,426 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,434 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,442 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,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:17,452 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:39:17,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,473 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:39:17,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,479 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,480 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:39:17,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,494 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 23 treesize of output 18 [2019-03-04 16:39:17,494 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,501 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:17,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:39:17,514 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,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:17,527 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:17,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:17,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:39:17,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:17,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:17,548 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-03-04 16:39:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:17,885 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-03-04 16:39:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:17,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:39:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:17,889 INFO L225 Difference]: With dead ends: 390 [2019-03-04 16:39:17,889 INFO L226 Difference]: Without dead ends: 377 [2019-03-04 16:39:17,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-03-04 16:39:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-03-04 16:39:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-03-04 16:39:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-03-04 16:39:18,011 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-03-04 16:39:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:18,011 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-03-04 16:39:18,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-03-04 16:39:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:18,012 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:18,012 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:39:18,013 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-03-04 16:39:18,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,232 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:39:18,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:18,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:18,232 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:18,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,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 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:39:18,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:18,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:18,253 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 15 treesize of output 18 [2019-03-04 16:39:18,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,256 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 18 treesize of output 20 [2019-03-04 16:39:18,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,262 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 20 treesize of output 22 [2019-03-04 16:39:18,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:18,272 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,280 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,287 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,295 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,308 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,308 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:18,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,335 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,335 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,348 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:18,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,378 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:39:18,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,392 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:18,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:18,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,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, 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:39:18,420 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,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:39:18,434 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:18,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,519 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:39:18,519 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,533 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:18,533 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:18,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,564 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:39:18,564 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,578 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,578 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:18,598 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:39:18,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:18,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:39:18,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:18,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:39:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:39:18,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:18,697 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-03-04 16:39:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:19,397 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-03-04 16:39:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:19,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:39:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:19,402 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:39:19,402 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 16:39:19,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:39:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 16:39:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-03-04 16:39:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-03-04 16:39:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-03-04 16:39:19,511 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-03-04 16:39:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:19,511 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-03-04 16:39:19,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:39:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-03-04 16:39:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:19,512 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:19,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:19,512 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-03-04 16:39:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:19,633 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:19,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:19,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:19,634 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-03-04 16:39:19,635 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:19,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:19,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:19,638 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:39:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:19,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:19,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,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 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:39:19,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:19,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:19,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:39:19,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,665 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 18 treesize of output 20 [2019-03-04 16:39:19,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,670 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 20 treesize of output 22 [2019-03-04 16:39:19,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:19,680 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,688 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,694 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,701 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,713 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:19,713 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:19,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,738 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:19,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,752 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:19,752 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:19,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,775 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:19,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,801 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:19,801 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:19,839 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:19,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:19,857 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:19,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:39:19,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:19,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:39:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:39:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:19,876 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-03-04 16:39:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:20,162 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-03-04 16:39:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:20,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:39:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:20,164 INFO L225 Difference]: With dead ends: 157 [2019-03-04 16:39:20,164 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:39:20,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:39:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-03-04 16:39:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:39:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-03-04 16:39:20,274 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-03-04 16:39:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:20,274 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-03-04 16:39:20,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:39:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-03-04 16:39:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:20,275 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:20,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:20,275 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-03-04 16:39:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:20,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,427 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:20,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:20,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:20,427 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-03-04 16:39:20,428 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:20,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:20,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:20,431 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:39:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:20,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:20,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:20,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:20,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:20,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:20,480 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 15 treesize of output 18 [2019-03-04 16:39:20,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,516 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 18 treesize of output 20 [2019-03-04 16:39:20,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,524 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 20 treesize of output 22 [2019-03-04 16:39:20,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,540 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:20,540 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,546 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,554 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,562 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,574 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:20,574 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:20,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,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, 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:20,599 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,612 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:20,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:20,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,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, 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:20,767 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,779 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:20,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:20,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,805 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:20,806 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,820 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,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:20,844 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:20,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:20,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:20,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:20,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:20,916 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-03-04 16:39:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:21,408 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-03-04 16:39:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:21,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:39:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:21,410 INFO L225 Difference]: With dead ends: 206 [2019-03-04 16:39:21,410 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:39:21,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:39:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-03-04 16:39:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:39:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-03-04 16:39:21,575 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-03-04 16:39:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:21,575 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-03-04 16:39:21,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-03-04 16:39:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:21,576 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:21,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:21,576 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-03-04 16:39:21,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:21,744 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,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:21,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:21,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:21,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,745 INFO 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:39:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:21,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:21,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:21,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:21,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:39:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:39:21,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,791 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:39:21,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,808 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 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:39:21,808 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,815 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,823 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,830 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,843 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:21,843 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:39:21,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,870 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:21,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,880 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:21,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:21,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:39:21,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,910 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:21,910 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-03-04 16:39:21,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,931 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 28 treesize of output 23 [2019-03-04 16:39:21,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,942 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:21,942 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:39:21,962 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:21,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:21,991 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:22,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:22,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:22,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:22,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:22,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:22,011 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-03-04 16:39:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:22,487 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-03-04 16:39:22,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:22,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:39:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:22,489 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:39:22,490 INFO L226 Difference]: Without dead ends: 156 [2019-03-04 16:39:22,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-03-04 16:39:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-03-04 16:39:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:39:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-03-04 16:39:22,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-03-04 16:39:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:22,560 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-03-04 16:39:22,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-03-04 16:39:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:39:22,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:22,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:22,561 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-03-04 16:39:22,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,740 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,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:39:22,741 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-03-04 16:39:22,742 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:22,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:22,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:22,746 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:39:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:22,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,746 INFO 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:39:22,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,764 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 15 treesize of output 18 [2019-03-04 16:39:22,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,770 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 18 treesize of output 20 [2019-03-04 16:39:22,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,775 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 20 treesize of output 22 [2019-03-04 16:39:22,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,785 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:22,786 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,794 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,801 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,809 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,821 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:22,821 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:22,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,844 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:22,844 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,858 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:22,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:22,877 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,880 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, 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:22,884 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,916 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:22,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:22,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,942 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:39:22,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,956 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,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:22,975 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,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:23,009 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:23,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:23,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:23,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:23,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:23,029 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-03-04 16:39:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:23,397 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-03-04 16:39:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:23,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:39:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:23,399 INFO L225 Difference]: With dead ends: 62 [2019-03-04 16:39:23,399 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:39:23,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:39:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-03-04 16:39:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:39:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-03-04 16:39:23,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-03-04 16:39:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-03-04 16:39:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-03-04 16:39:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:39:23,499 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:23,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:23,500 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-03-04 16:39:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:23,626 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:39:23,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:23,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:23,627 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:39:23,627 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-03-04 16:39:23,628 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:23,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:23,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:23,631 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:39:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:23,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:23,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:23,631 INFO 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:39:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:23,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:23,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:23,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:23,653 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 15 treesize of output 18 [2019-03-04 16:39:23,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,659 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 18 treesize of output 20 [2019-03-04 16:39:23,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,670 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 20 treesize of output 22 [2019-03-04 16:39:23,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,684 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:23,684 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,691 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,699 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,708 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,720 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,720 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:23,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,746 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:23,746 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,759 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:23,760 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:23,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,787 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:23,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,801 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:23,801 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:23,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,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, 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:39:23,848 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:23,865 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:23,865 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:23,884 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:23,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:23,939 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:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-03-04 16:39:23,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:23,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:23,958 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-03-04 16:39:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:24,387 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-03-04 16:39:24,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:24,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-03-04 16:39:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:24,387 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:39:24,387 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:39:24,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:39:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-03-04 16:39:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:39:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-03-04 16:39:24,521 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-03-04 16:39:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:24,521 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-03-04 16:39:24,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-03-04 16:39:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:39:24,522 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:24,522 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:24,523 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-03-04 16:39:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:24,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:24,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:24,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:24,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:24,669 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:39:24,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:24,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:24,670 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:24,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,670 INFO 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:39:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:24,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:24,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:24,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:24,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:24,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:24,691 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 15 treesize of output 18 [2019-03-04 16:39:24,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,693 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 18 treesize of output 20 [2019-03-04 16:39:24,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,700 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 20 treesize of output 22 [2019-03-04 16:39:24,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,710 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:24,710 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,716 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,724 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,730 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,744 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:24,745 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:24,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,771 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:24,772 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,786 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:24,786 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:24,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,809 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:39:24,810 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,824 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:24,824 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:24,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,849 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:39:24,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,863 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:24,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:24,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,890 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:39:24,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,905 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,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:24,926 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:39:24,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:24,968 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:39:24,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:24,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-03-04 16:39:24,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:24,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:24,987 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-03-04 16:39:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:25,472 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-03-04 16:39:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:25,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:39:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:25,474 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:39:25,474 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:39:25,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:39:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-03-04 16:39:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:39:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-03-04 16:39:25,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-03-04 16:39:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:25,572 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-03-04 16:39:25,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-03-04 16:39:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:39:25,572 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:25,572 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:25,572 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-03-04 16:39:25,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:25,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,732 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:39:25,763 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:39:25,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:25,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:39:25,764 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-03-04 16:39:25,766 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:25,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:25,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:25,768 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:39:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:25,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,769 INFO 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:39:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:25,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:25,786 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 15 treesize of output 18 [2019-03-04 16:39:25,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,791 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 18 treesize of output 20 [2019-03-04 16:39:25,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,803 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 20 treesize of output 22 [2019-03-04 16:39:25,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,818 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:25,818 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,827 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,835 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,841 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,854 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:25,854 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:25,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,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:25,879 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,892 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:25,893 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:25,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,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, 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:25,919 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,931 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:25,931 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:25,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,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, 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:25,968 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,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:25,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:26,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,010 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:39:26,010 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,024 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:26,024 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:26,040 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:39:26,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-03-04 16:39:26,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:26,097 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-03-04 16:39:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:26,457 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-03-04 16:39:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:26,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:39:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:26,458 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:39:26,458 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:39:26,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:39:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-03-04 16:39:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:39:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-03-04 16:39:26,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-03-04 16:39:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:26,580 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-03-04 16:39:26,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-03-04 16:39:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:39:26,581 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:26,581 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:26,581 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-03-04 16:39:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:26,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:26,729 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:39:26,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:26,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:26,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:26,730 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:26,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:26,730 INFO 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:39:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:26,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:26,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:26,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:26,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:26,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:26,751 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 15 treesize of output 18 [2019-03-04 16:39:26,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,757 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 18 treesize of output 20 [2019-03-04 16:39:26,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,768 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 20 treesize of output 22 [2019-03-04 16:39:26,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,779 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [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,785 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,793 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,800 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,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:26,814 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:26,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,848 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:26,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,876 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:26,877 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:26,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,903 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:26,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,917 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:26,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:26,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,944 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:39:26,945 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,961 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:26,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:26,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:39:26,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,998 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:26,999 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:27,019 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:39:27,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:27,070 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:39:27,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:27,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:39:27,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:27,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:39:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:39:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:27,090 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-03-04 16:39:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:27,519 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-03-04 16:39:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:27,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:39:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:27,520 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:39:27,520 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:39:27,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:39:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:39:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-03-04 16:39:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:39:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-03-04 16:39:27,652 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-03-04 16:39:27,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:27,652 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-03-04 16:39:27,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:39:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-03-04 16:39:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:39:27,653 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:27,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:27,653 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-03-04 16:39:27,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,838 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:39:27,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:27,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:39:27,839 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-03-04 16:39:27,839 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:27,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:27,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:27,842 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:39:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:27,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,843 INFO 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:39:27,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:27,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:27,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:27,862 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 15 treesize of output 18 [2019-03-04 16:39:27,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,868 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 18 treesize of output 20 [2019-03-04 16:39:27,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,878 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 20 treesize of output 22 [2019-03-04 16:39:27,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:27,891 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,898 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,906 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,913 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,926 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,927 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:27,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,954 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:27,954 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,993 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:27,994 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:28,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,021 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,022 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,035 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,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:28,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,062 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:39:28,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,091 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,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [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,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:39:28,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,132 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,132 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:28,154 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:39:28,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:28,199 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:39:28,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:28,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:28,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:28,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:28,218 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-03-04 16:39:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:28,763 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-03-04 16:39:28,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:28,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:39:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:28,764 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:39:28,765 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:39:28,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:39:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-03-04 16:39:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:39:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-03-04 16:39:28,914 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-03-04 16:39:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-03-04 16:39:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-03-04 16:39:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:39:28,914 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:28,914 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:28,914 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-03-04 16:39:28,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:28,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:39:29,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:29,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:29,142 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:29,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,142 INFO 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:39:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:29,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:29,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:39:29,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:29,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:29,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:29,162 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 15 treesize of output 18 [2019-03-04 16:39:29,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,166 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 18 treesize of output 20 [2019-03-04 16:39:29,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,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 20 treesize of output 22 [2019-03-04 16:39:29,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:39:29,183 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,190 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,198 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,207 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,221 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,221 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:39:29,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,249 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:29,249 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,264 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:29,264 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:29,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,294 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:39:29,294 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,309 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:29,309 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:29,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:39:29,380 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,453 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:29,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:29,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,483 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 35 treesize of output 30 [2019-03-04 16:39:29,483 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,496 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,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:29,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,527 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 35 treesize of output 30 [2019-03-04 16:39:29,527 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,540 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,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:29,567 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:39:29,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:29,685 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:39:29,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:29,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-03-04 16:39:29,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:29,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:29,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:39:29,705 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-03-04 16:39:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:30,302 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-03-04 16:39:30,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:30,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 16:39:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:30,303 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:39:30,303 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:39:30,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:39:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:39:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:39:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:39:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:39:30,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-03-04 16:39:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:30,305 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:39:30,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:39:30,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:39:30,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:39:30,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:30,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:31,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:32,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:33,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:34,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:34,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:34,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:34,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:35,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:37,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:37,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:37,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:38,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:38,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:38,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:38,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:38,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:39:39,124 WARN L181 SmtUtils]: Spent 8.81 s on a formula simplification. DAG size of input: 1846 DAG size of output: 971 [2019-03-04 16:39:52,930 WARN L181 SmtUtils]: Spent 13.80 s on a formula simplification. DAG size of input: 876 DAG size of output: 81 [2019-03-04 16:39:52,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:39:52,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-03-04 16:39:52,934 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-03-04 16:39:52,934 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-03-04 16:39:52,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-03-04 16:39:52,934 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse19 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse16 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse14 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse16 (- 1)))) (.cse0 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse18 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse19 (- 1))))) (let ((.cse3 (<= .cse19 0)) (.cse6 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) (.cse5 (select .cse18 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1))) (.cse2 (= .cse16 0)) (.cse17 (select .cse14 ULTIMATE.start_main_p3)) (.cse7 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse12 (= (select .cse14 ULTIMATE.start_main_p2) 0)) (.cse8 (= 0 (select .cse18 ULTIMATE.start_main_p1))) (.cse15 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse1 1)))) (or (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse0) (<= 0 .cse1) .cse2 .cse3 (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0) (= 0 .cse5) .cse6 .cse7 .cse3 .cse8) (or (and (let ((.cse11 (<= .cse16 0)) (.cse10 (<= (+ (select .cse15 ULTIMATE.start_main_p2) 1) 0)) (.cse9 (select .cse14 ULTIMATE.start_main_p1))) (or (and (and (= .cse9 0) .cse10) .cse11 .cse6) (and .cse11 (let ((.cse13 (and (<= 1 .cse9) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))))) (or (and .cse12 .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (and .cse10 .cse13)))))) (<= 0 .cse17)) (and (<= 1 .cse5) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) .cse7 (= (select .cse4 ULTIMATE.start_main_p2) 0) .cse2 .cse8)) (and (and (<= 1 .cse17) .cse7 .cse12 .cse8) (<= (+ (select .cse15 ULTIMATE.start_main_p4) 1) 0)))))) [2019-03-04 16:39:52,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:39:52,935 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-03-04 16:39:52,935 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-03-04 16:39:52,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-03-04 16:39:52,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-03-04 16:39:52,951 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:39:52 BoogieIcfgContainer [2019-03-04 16:39:52,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:39:52,952 INFO L168 Benchmark]: Toolchain (without parser) took 79158.77 ms. Allocated memory was 139.5 MB in the beginning and 749.2 MB in the end (delta: 609.7 MB). Free memory was 107.1 MB in the beginning and 185.8 MB in the end (delta: -78.7 MB). Peak memory consumption was 608.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:39:52,952 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:39:52,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.90 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 104.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:39:52,953 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:39:52,953 INFO L168 Benchmark]: RCFGBuilder took 422.10 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:39:52,953 INFO L168 Benchmark]: TraceAbstraction took 78659.21 ms. Allocated memory was 139.5 MB in the beginning and 749.2 MB in the end (delta: 609.7 MB). Free memory was 92.9 MB in the beginning and 185.8 MB in the end (delta: -92.9 MB). Peak memory consumption was 594.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:39:52,955 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.90 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 104.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.10 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78659.21 ms. Allocated memory was 139.5 MB in the beginning and 749.2 MB in the end (delta: 609.7 MB). Free memory was 92.9 MB in the beginning and 185.8 MB in the end (delta: -92.9 MB). Peak memory consumption was 594.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2) || (((((#memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p3 == p1)) && p1 + 3 <= p4) && #memory_int[p2] <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) || (((((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && #memory_int[p4] <= 0) && !(p3 == p1)) || (#memory_int[p4] <= 0 && (((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && (1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p2 == p1)) && !(p1 == p4)) && !(p3 == p2)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p2 == p1)) && !(p1 == p4))))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (((((1 <= #memory_int[p2 := #memory_int[p2] + -1][p3] && !(p2 == p4)) && p1 + 3 <= p4) && #memory_int[p3 := #memory_int[p3] + 1][p2] == 0) && #memory_int[p4] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) || ((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && p1 + 3 <= p4) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 78.5s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 22.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 325 HoareAnnotationTreeSize, 1 FomulaSimplifications, 185184663 FormulaSimplificationTreeSizeReduction, 8.8s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7943067 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...